Submission #1276189

#TimeUsernameProblemLanguageResultExecution timeMemory
1276189KindaGoodGamesHoliday (IOI14_holiday)C++20
23 / 100
12 ms1944 KiB
#include"holiday.h" #include<bits/stdc++.h> using namespace std; #define int long long long long findMaxAttraction(int32_t n, int32_t s, int32_t d, int32_t arr[]) { int ma = 0; int sum = 0; priority_queue<int, vector<int>, greater<int>> pq; for(int i = 0; i < n; i++){ sum += arr[i]; pq.push(arr[i]); if(i > d) break; while(i+pq.size() > d){ sum -= pq.top(); pq.pop(); } ma = max(ma, sum); } return ma; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...