제출 #1163565

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1163565		justin271828	Akcija (COCI21_akcija)	C++20	30 / 110	2 ms	328 KiB

Main

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

#define l2 long long
#define ii pair<l2, l2>

int main() {
    l2 n, k;
    cin >> n >> k;
    ii arr[n];
    for (l2 i = 0; i < n; i++) {
        l2 w, d;
        cin >> w >> d;
        arr[i] = {0-d, w};}
    sort(arr, arr+n);
    l2 count = 0;
    priority_queue<l2, vector<l2>, greater<l2>> pq;
    l2 ans = 0;
    l2 number = 0;
    for (l2 i = 2000; i > 0; i--) {
        while (0-arr[count].first >= i) {
            pq.push(arr[count++].second);
        }
        if (!pq.empty()) {
            ans += pq.top();
            number++;
            pq.pop();
        }
    }
    cout << number << " " << ans;
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 10
• Subtask 5: 0 / 30
• Subtask 6: 0 / 20