제출 #1153519

#제출 시각아이디문제언어결과실행 시간메모리
1153519BlockOG휴가 (IOI14_holiday)C++20
23 / 100
11 ms1220 KiB
#include "holiday.h" #include <iostream> #include <queue> // meow mrrow nya nya :3c // play vivid/stasis. free on steam using namespace std; long long findMaxAttraction(int n, int start, int d, int attraction[]) { if (start != 0) return 0; long long res = 0; long long sum = 0; priority_queue<int, vector<int>, greater<int>> q; for (int i = 0; i < n && d; i++, d--) { sum += attraction[i]; q.push(attraction[i]); while (q.size() > d) { sum -= q.top(); q.pop(); } res = max(res, sum); } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...