Submission #682504

#TimeUsernameProblemLanguageResultExecution timeMemory
682504vjudge1Road Construction (JOI21_road_construction)C++17
5 / 100
1491 ms2097152 KiB
#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 = i + 1; j < n; j++){
			ans.pb(abs(x[i] - x[j]) + abs(y[i] - y[j]));
		}
	}
	sort(ans.begin(), ans.end());
	for(ll i = 0; i < k; i++){
		cout << ans[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...