Submission #576840

#TimeUsernameProblemLanguageResultExecution timeMemory
576840SlavicGHoliday (IOI14_holiday)C++17
23 / 100
42 ms6224 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...