#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int nx=250005;
ll n, k, x[nx], y;
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n>>k;
for (int i=0; i<n; i++) cin>>x[i]>>y;
sort(x, x+n);
priority_queue<tuple<ll, ll, ll>, vector<tuple<ll, ll, ll>>, greater<tuple<ll, ll, ll>>> pq;
for (int i=0; i<n-1; i++) pq.push({x[i+1]-x[i], i, i+1});
for (int t=1; t<=k; t++)
{
auto [d, a, b]=pq.top();
pq.pop();
cout<<d<<'\n';
if (a!=0) pq.push({x[b]-x[a-1], a-1, b});
}
}
/*
5 10
10 0
4 0
-1 0
2 0
11 0
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
31 ms |
2896 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
106 ms |
10188 KB |
Output is correct |
2 |
Correct |
103 ms |
9460 KB |
Output is correct |
3 |
Correct |
30 ms |
2908 KB |
Output is correct |
4 |
Correct |
80 ms |
9924 KB |
Output is correct |
5 |
Correct |
69 ms |
9924 KB |
Output is correct |
6 |
Correct |
74 ms |
10432 KB |
Output is correct |
7 |
Correct |
73 ms |
8900 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
60 ms |
9412 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
60 ms |
9412 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
31 ms |
2896 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
31 ms |
2896 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |