Submission #856415

#	Time	Username	Problem	Language	Result	Execution time	Memory
856415		overwatch9	Sails (IOI07_sails)	C++17	30 / 100	1088 ms	5356 KiB

sails

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
using ll = long long;
int main() {
    int n;
    cin >> n;
    vector <pair <int, int>> updates(n);
    for (int i = 0; i < n; i++) {
        cin >> updates[i].first >> updates[i].second;
    }
    sort(updates.begin(), updates.end());
    ll ans = 0;
    vector <ll> sails(1e5 + 1);
    for (int i = 0; i < n; i++) {
        priority_queue <pair <ll, int>> pq;
        for (int j = 1; j <= updates[i].first; j++)
            pq.push({-sails[j], j});
        for (int j = 0; j < updates[i].second; j++) {
            ll x = -pq.top().first;
            int id = pq.top().second;
            pq.pop();
            ans += x;
            sails[id]++;
        }
    }
    cout << ans << '\n';
}

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