제출 #1160042

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1160042		mariaclara	Road Construction (JOI21_road_construction)	C++20	6 / 100	493 ms	25244 KiB

road_construction

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll,int> pii;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define fr first 
#define sc second 

int n, k;
int main() {

    cin >> n >> k;

    vector<ll> dist, x(n), y(n), ind(n);
    set<pii> val;

    for(int i = 0; i < n; i++)
        cin >> x[i] >> y[i];

    sort(all(x));

    for(int i = 0; i < n; i++) {
        ind[i] = i-1;
        if(i) val.insert({x[i] - x[i-1], i});
    }

    while(sz(dist) < k) {
        auto [d, i] = *val.begin();
        val.erase(val.begin());

        dist.pb(d);
        ind[i]--;
        if(ind[i] != -1) val.insert({x[i] - x[ind[i]], i});
    }

    for(int i = 0; i < k; i++)
        cout << dist[i] << "\n";
}

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