제출 #1277376

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1277376		ngunguoi45	Unija (COCI17_unija)	C++17	80 / 100	124 ms	58828 KiB

unija

#include <bits/stdc++.h>

using namespace std;

const int maxn = (int)1e6+5;
const int maxv = (int)1e6+5;
const int center = (int)1e6;


int n;
vector<pair<int,int>> events[2*maxv];
priority_queue<pair<int,int>> pq;
long long ans = 0;

int main () {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n;
    for (int i = 1;i <= n; i++) {
        int x, y;
        cin >> x >> y;
        int l = center - x/2;
        int r = center + x/2;
        events[l+1].push_back({y, r});
    }
    for (int i = 0;i < 2*maxv; i++) {
        for (pair<int,int> cur: events[i]) {
            pq.push(cur);
        }
        while ((int)pq.size() && pq.top().second < i) pq.pop();
        if (!pq.empty()) {
            ans += pq.top().first;
        }

    }
    cout << ans << "\n";
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 0 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 0 / 10