제출 #1182453

#제출 시각아이디문제언어결과실행 시간메모리
1182453stdfloat휴가 (IOI14_holiday)C++20
0 / 100
5095 ms1032 KiB
#include <bits/stdc++.h> #include "holiday.h" // #include "grader.cpp" using namespace std; using ll = long long; long long findMaxAttraction(int n, int st, int D, int a[]) { assert(!st); ll mx = 0; priority_queue<int> pq; for (int i = 0; i < min(n, D); i++) { pq.push(a[i]); ll sm = 0; queue<int> q; for (int j = 0; j < D - i && !pq.empty(); j++) { sm += pq.top(); q.push(pq.top()); pq.pop(); } mx = max(mx, sm); while (!q.empty()) { pq.push(q.front()); q.pop(); } } return mx; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...