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;
vector< long long > v;
int main() {
int n, k;
cin >> n >> k;
long long x[n + 1], y[n + 1];
for( int i = 1; i <= n; i++ ){
cin >> x[i] >> y[i];
}
for( int i = 1; i <= n; i++ ){
for( int j = i + 1; j <= n; j++ ){
v.push_back( abs( x[i] - x[j] ) + abs( y[i] - y[j] ) );
}
}
sort(v.begin(), v.end());
for( int i = 0; i < k; i++ )
cout << v[i] << endl;
}
# | 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... |