Submission #1153502

#TimeUsernameProblemLanguageResultExecution timeMemory
1153502BlockOGHoliday (IOI14_holiday)C++20
0 / 100
10 ms1220 KiB
#include "holiday.h"
#include <iostream>
#include <queue>

// meow mrrow nya nya :3c
// play vivid/stasis. free on steam

using namespace std;

long long findMaxAttraction(int n, int start, int d, int attraction[]) {
    if (start != 0) return 0;

    long long res = 0;

    long long sum = 0;
    priority_queue<int, vector<int>, greater<int>> q;
    for (int i = 0; i < n && d; i++) {
        d--;
        sum += attraction[i];
        q.push(attraction[i]);

        while (q.size() > d) {
            sum -= q.top();
            q.pop();
        }

        res = max(res, sum);
    }

    return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...