Submission #893426

#TimeUsernameProblemLanguageResultExecution timeMemory
893426abushbandit_1Road Construction (JOI21_road_construction)C++17
5 / 100
776 ms2097152 KiB
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define ff first
#define ss second

const long long INF = 1e18;
const int N = 1e5 + 1;

signed main(){
	
	int n;
	cin >> n;
	int k;
	cin >> k;
	int cnt = 0;
	int x[n],y[n];
	for(int i = 0;i < n;i++){
		cin >> x[i] >> y[i];
		if(y[i] == 0){
			cnt++;
		}
	}
	vector<int> v;
	for(int i = 0;i < n;i++){
		for(int j = i + 1;j < n;j++){
			v.pb(abs(x[i] - x[j]) + abs(y[i] - y[j]));
		}
	}
	sort(all(v));
	for(int i = 0;i < k;i++){
		cout << v[i] << "\n";
	}
		
}
#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...