Submission #1294898

#	Time	Username	Problem	Language	Result	Execution time	Memory
1294898		kian2009	Road Construction (JOI21_road_construction)	C++20	6 / 100	355 ms	23308 KiB

road_construction

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

typedef long long ll;

const int MAXN = 3e5 + 10;

ll n, k, x[MAXN], y[MAXN];
set<pair<ll, ll>> s;
vector<ll> res;

void input() {
	cin >> n >> k;
	for (int i = 0; i < n; i++)
		cin >> x[i] >> y[i];	
}

void findAns() {
	for (int i = 0; i < n - 1; i++)
		s.insert({x[i + 1] - x[i], i + 1});
	while (res.size() < k) {
		pair<ll, ll> h = (*s.begin());
		res.push_back(h.first);
		s.erase(h);
		if (h.second != (n - 1))
			s.insert({h.first + x[h.second + 1] - x[h.second], h.second + 1});	
	}
}

int main() {
	ios::sync_with_stdio(false); cin.tie(0);
	input();
	sort(x, x + n);
	findAns();
	for (auto x : res)
		cout << x << '\n';
	return 0;	
}

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