# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
69334 | MKopchev | 휴가 (IOI14_holiday) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include "holiday.h"
using namespace std;
priority_queue<int> q;
long long int findMaxAttraction(int n, int start, int d,vector<int> attraction)
{
assert(start==0);
long long ans=0,sum=0;
for(int i=0;i<n;i++)
{
q.push(-attraction[i]);
sum=sum+attraction[i];
while(q.size()>d-i)
{
sum=sum+q.top();
q.pop();
}
ans=max(ans,sum);
}
return ans;
}