Submission #736123

#TimeUsernameProblemLanguageResultExecution timeMemory
736123QwertyPiRoad Construction (JOI21_road_construction)C++14
5 / 100
10118 ms378784 KiB
#include <bits/stdc++.h>
#define int long long
using namespace std;

struct point{
	int a, b;
};

vector<point> P;

int d(point x, point y){
	return max(abs(x.a - y.a), abs(x.b - y.b));
}

int32_t main(){
	int n, k; cin >> n >> k;
	for(int i = 0; i < n; i++){
		int x, y; cin >> x >> y;
		P.push_back({x + y, x - y});
	}
	
	multiset<int> S;
	for(int i = 0; i < n; i++){
		for(int j = i + 1; j < n; j++){
			S.insert(d(P[i], P[j]));
		}
	}
	for(auto i : S){
		if(k){
			cout << i << endl;
			k--;
		}
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...