#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second
int n, k;
int main() {
cin >> n >> k;
vector<int> dist, x(n), y(n);
for(int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
for(int j = 0; j < i; j++)
dist.pb(abs(x[i] - x[j]) + abs(y[i] - y[j]));
}
sort(all(dist));
for(int i = 0; i < k; i++)
cout << dist[i] << "\n";
}
# | 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... |