-
Notifications
You must be signed in to change notification settings - Fork 0
/
AGGRCOW.cpp
55 lines (51 loc) · 1 KB
/
AGGRCOW.cpp
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
#include<bits/stdc++.h>
using namespace std;
bool solutionExist(int N, int C, int *arr, int ans) {
int cnt = 1;
int last = arr[0];
for (int i = 1; i < N; i++) {
if (arr[i] - last >= ans) {
cnt++;
last = arr[i];
}
}
if (cnt >= C) {
return true;
}
return false;
}
void solve(int N, int C, int *arr) {
sort(arr, arr + N);
int low = 0;
int high = arr[N - 1] - arr[0];
//We are making a binary search on answer
int ans = (high - low) / 2;
//We are not making comparison when low is equal to high, an extra check can be applied after the while loop
while (low < high) {
ans = (high + low) / 2;
if (solutionExist(N, C, arr, ans)) {
low = ans + 1;
} else {
high = ans;
}
}
ans = (low + high) / 2;
ans--;
cout << ans << endl;
}
int main() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
int T;
cin >> T;
while (T--) {
int N, C;
cin >> N >> C;
int *arr = new int[N];
for (int i = 0; i < N; i++) {
cin >> arr[i];
}
solve(N, C, arr);
}
return 0;
}