This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
int N, K;
cin >> N >> K;
int x[N], y[N];
priority_queue< int, vector<int>, greater<int> > costs;
for (int i = 0; i < N; i++)
{
cin >> x[i] >> y[i];
for (int j = 0; j < i; j++)
{
int distance = abs(x[i] - x[j]) + abs(y[i] - y[j]);
costs.push(distance);
}
}
for (int i = 0; i < K; i++)
{
cout << costs.top() << "\n";
costs.pop();
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |