1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
|
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define fi first
#define se second
#define pb push_back
#define SZ(a) ((int) a.size())
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (int i = (a); i >= (b); --i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
typedef pair<ll,ll> pll;
typedef array<ll,3> arr;
typedef double DB;
typedef pair<DB,DB> pdd;
typedef pair<ll,bool> plb;
constexpr ll MAXN=static_cast<ll>(4e5)+10,INF=static_cast<ll>(5e18)+3;
constexpr ll mod=static_cast<ll>(1e9)+7;
constexpr ll range=static_cast<ll>(7e6)+5;
ll N,M,T,A[MAXN];
ll isPrime[range+10];
vector<ll> primes;
ll primeSum[MAXN];
inline void genPrime(){
FOR(i,2,range) {isPrime[i]=true;}
for(int i=2;i*i<=range;++i){
if(!isPrime[i]) continue;
for(int j=2*i;j<=range;j+=i){
isPrime[j]=false;
}
}
for(int i=2;i<=range;++i){
if(isPrime[i]) primes.pb(i);
}
}
inline bool check(ll x){
if(x==N-1) return true;
ll res=0;
FOR(i,1+x,N){
res+=A[i];
}
ll stand=0;
ll len=N-x;
if(len==2){
stand=5;
}else{
FOR(i,0,len-1){
stand+=primes[i];
}
}
if(res>=stand) return true;
return false;
}
inline void solve(){
cin>>N;
FOR(i,1,N){
cin>>A[i];
}
sort(A+1,A+1+N);
ll l=0,r=N-1;
while(l<r){
ll mid=l+r>>1;
if(check(mid)){
r=mid;
}else{
l=mid+1;
}
}
cout<<l<<"\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>T;
genPrime();
while(T--){
solve();
}
return 0;
}
|