#include <bits/stdc++.h>
#define all(a) sort(a.begin(), a.end())
#define allr(a) reverse(a.begin(), a.end())
#define rall(a) sort(a.rbegin(), a.rend())
#define ll long long
#define pb push_back
#define pob pop_back
#define ff first
#define ss second
#define mk make_pair
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
ll x[n + 2], y[n + 2];
vector<ll> ans;
for(ll i = 0; i < n; i++){
cin >> x[i] >> y[i];
}
for(ll i = 0; i < n; i++){
for(ll j = 0; j < n; j++){
ans.pb(abs(x[i] - x[j]) + abs(y[i] - y[j]));
}
}
all(ans);
for(ll i = 0; i < k; i++){
cout << ans[i] << '\n';
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
103 ms |
10740 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1539 ms |
2097152 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1446 ms |
2097152 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1446 ms |
2097152 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
103 ms |
10740 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
103 ms |
10740 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |