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>
using namespace std;
#define int long long
typedef pair<int, int> pii;
#define fi first
#define se second
signed main(){
cin.tie(0); ios_base::sync_with_stdio(0);
int n, k;
cin >> n >> k;
vector<int> x(n), y(n);
for(int i=0; i<n; i++){
cin >> x[i] >> y[i];
}
vector<int> cost;
cost.reserve(n*(n-1)/2);
for(int i=0; i<n; i++){
for(int j=i+1; j<n; j++){
cost.push_back(abs(x[i]-x[j]) + abs(y[i]-y[j]));
// cout << i << ' ' << j << ':' << ' ' << cost.back() << '\n';
}
}
sort(cost.begin(), cost.end());
for(int i=0; i<k; i++){
cout << cost[i] << '\n';
}
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... |