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;
struct point{
int a, b;
};
vector<point> P;
int d(point x, point y){
return max(abs(x.a - y.a), abs(x.b - y.b));
}
int32_t main(){
int n, k; cin >> n >> k;
for(int i = 0; i < n; i++){
int x, y; cin >> x >> y;
P.push_back({x + y, x - y});
}
multiset<int> S;
for(int i = 0; i < n; i++){
for(int j = i + 1; j < n; j++){
S.insert(d(P[i], P[j]));
}
}
for(auto i : S){
if(k){
cout << i << endl;
k--;
}
}
}
# | 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... |