#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1000000000000000000
#define MOD 1000000007
const int B = 650;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, k;
cin >> n >> k;
int x[n], y[n];
for(int i = 0; i < n; i++) cin >> x[i] >> y[i];
priority_queue<int> pq;
sort(x, x+n);
for(int i = 0; i < n; i++) {
for(int j = i+1; j < min(n, i+B); j++) {
pq.push(x[j]-x[i]);
if((int)pq.size() > k) pq.pop();
}
}
vector<int> ans;
while(pq.size()) {
ans.push_back(pq.top());
pq.pop();
}
reverse(ans.begin(), ans.end());
for(int i : ans) cout << i << '\n';
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
67 ms |
6732 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7961 ms |
9388 KB |
Output is correct |
2 |
Correct |
8073 ms |
9392 KB |
Output is correct |
3 |
Incorrect |
44 ms |
6896 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1016 ms |
4188 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1016 ms |
4188 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
67 ms |
6732 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
67 ms |
6732 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |