# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
722193 | Ronin13 | Holiday (IOI14_holiday) | C++14 | 38 ms | 5556 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"holiday.h"
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define epb emplace_back
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
using namespace std;
long long int findMaxAttraction(int n, int start, int d, int a[]) {
if(start == 0){
multiset <ll> st;
ll s = 0;
ll mx = 0;
for(int i = 0; i < n; i++){
int x = d - i;
st.insert(a[i]);
s += a[i];
while(st.size() > x)
s -= *st.begin(), st.erase(st.begin());
mx = max(mx, s);
}
return mx;
}
return 0;
}
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... |