Submission #1277299

#TimeUsernameProblemLanguageResultExecution timeMemory
1277299JohannHoliday (IOI14_holiday)C++20
23 / 100
10 ms1720 KiB
#include "holiday.h"

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

#define sz(x) (int)(x.size())

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;

long long int findMaxAttraction(int n, int start, int d, int attraction[])
{
    // solve subtask 2
    assert(start == 0);
    priority_queue<ll, vi, greater<ll>> pq;
    ll res = 0;
    ll max_res = 0;
    for (int i = 0; i < n; ++i)
    {
        res += attraction[i];
        pq.push(attraction[i]);
        while (!pq.empty() && sz(pq) > d - i)
        {
            res -= pq.top();
            pq.pop();
        }
        max_res = max(max_res, res);
    }
    return max_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...