-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path2032C.cpp
More file actions
62 lines (53 loc) · 1.47 KB
/
2032C.cpp
File metadata and controls
62 lines (53 loc) · 1.47 KB
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
#include <bits/stdc++.h>
using namespace std;
#define CODE ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
#define forn(i, n) for(int i = 0; i < n; i++)
#define for1(i, n) for(int i = 1; i <= n; i++)
#define foru(i, n) for(int i = n - 1; i >= 0; i--)
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define ppb pop_back
#define read(a) for(auto &i: a) cin >> i
#define out(answer) cout << answer << endl
#define yn(a) cout << (a ? "YES" : "NO") << endl
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef double dl;
signed main() {
CODE
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vi v(n);
read(v);
sort(all(v));
int answer = n;
int l = 1;
int r = n;
while (l <= r) {
int mid = (l + r) / 2;
bool val = false;
for (int i = 0; i + mid - 1 < n; i++) {
if (v[i] + v[i + 1] > v[i + mid - 1]) {
val = true;
break;
}
}
if (val) {
answer = min(answer, n - mid);
l = mid + 1;
} else {
r = mid - 1;
}
}
out(answer);
}
return 0;
}