# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
589405 | yutabi | Holiday (IOI14_holiday) | C++14 | 31 ms | 5552 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>
using namespace std;
typedef long long ll;
ll subtask(int n, int start, int d, int attraction[])
{
ll ans=attraction[0];
multiset <int> st;
st.insert(attraction[0]);
ll sum=attraction[0];
for(int i=1;i<n;i++)
{
sum+=attraction[i];
st.insert(attraction[i]);
while(st.size()>d-i)
{
sum-=*(st.begin());
st.erase(st.begin());
}
//printf("%lld\n",sum);
ans=max(ans,sum);
}
return ans;
}
long long int findMaxAttraction(int n, int start, int d, int attraction[])
{
if(d==0)
{
return 0;
}
if(start==0)
{
return subtask(n,start,d,attraction);
}
assert(0);
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... |