# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
590260 | Dan4Life | Holiday (IOI14_holiday) | C++17 | 44 ms | 5336 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>
#if !defined(LOL)
#include "holiday.h"
#endif
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
const int maxn = (int)2e5+10;
long long int findMaxAttraction(int n, int s, int d, int a[]) {
int ans = 0, sum = 0;
multiset<int> S; S.clear();
for(int i = 0; i < n; i++){
S.insert(a[i]); sum+=a[i];
int rem = d-i-1;
if(S.count(a[0])) rem++; rem = max(rem,0);
while(sz(S)>rem) sum-=*S.begin(), S.erase(S.begin());
ans = max(ans, sum);
}
return ans;
}
#if defined(LOL)
int main() {
int n, start, d;
int attraction[100000];
int i, n_s;
n_s = scanf("%d %d %d", &n, &start, &d);
for (i = 0 ; i < n; ++i) {
n_s = scanf("%d", &attraction[i]);
}
printf("%lld\n", findMaxAttraction(n, start, d, attraction));
return 0;
}
#endif
Compilation message (stderr)
# | 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... |