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;
#define ll long long
long long int findMaxAttraction(int n, int start, int d, int a[]) {
ll ans = 0;
multiset<ll> s;
ll sum = 0;
for(int i = 0; i < n; ++i) {
--d;
s.insert(a[i]);
sum += a[i];
while(d < 0 && !s.empty()) {
++d;
sum -= *s.begin();
s.erase(s.begin());
}
if(d < 0) break;
ans = max(ans, sum);
--d;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |