#include <iostream>
#include <vector>
#include <utility>
#include <sstream>
#include <climits>
#include <cstring>
#include <math.h>
#include <algorithm>
#define ll long long
#define ld long double
using namespace std;
const ll mod = 1e9 + 7;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
const int maxn1 = 2e5 + 5, maxn2 = 1e6 + 6;
ii coor[maxn1];
int dist[maxn2];
ll get_manhattan_dist(int i, int j)
{
return abs(coor[i].first - coor[j].first) + abs(coor[i].second - coor[j].second);
}
void solve()
{
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
{
cin >> coor[i].first >> coor[i].second;
}
int n_road = 0;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < i; j++)
{
dist[n_road++] = get_manhattan_dist(i, j);
}
}
sort(dist, dist + n_road);
for (int i = 0; i < k; i++)
{
cout << dist[i] << "\n";
}
}
int main()
{
// freopen("input_text", "r", stdin);
// freopen("output_text", "w", stdout);
// ios_base::sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
int t = 1;
// cin >> t;
while (t-- > 0)
solve();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
52 ms |
4848 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
82 ms |
6236 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
117 ms |
7688 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
117 ms |
7688 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
52 ms |
4848 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
52 ms |
4848 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |