Submission #701125

#	Time	Username	Problem	Language	Result	Execution time	Memory
701125		minhcool	Road Construction (JOI21_road_construction)	C++17	5 / 100	3630 ms	2097152 KiB

road_construction

#include<bits/stdc++.h>
using namespace std;

#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 3e5 + 5;

const int oo = 1e18 + 7, mod = 1e9 + 7;

int n, k;
ii a[N];

priority_queue<int, vector<int>, greater<int>> pq;

void process(){
	cin >> n >> k;
	for(int i = 1; i <= n; i++) cin >> a[i].fi >> a[i].se;
	for(int i = 1; i <= n; i++){
		for(int j = i + 1; j <= n; j++){
			pq.push({abs(a[i].fi - a[j].fi) + abs(a[i].se - a[j].se)});
			//if(pq.size() > k) pq.pop();
		}
	}
	for(int i = 1; i <= k; i++){
		cout << pq.top() << "\n";
		pq.pop();
	}
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	process();
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 6
• Subtask 3: 0 / 7
• Subtask 4: 0 / 20
• Subtask 5: 0 / 27
• Subtask 6: 0 / 35