Submission #532230

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
5322302022-03-02 14:15:13pokmui9909Candies (JOI18_candies)C++17
100 / 100
135 ms13404 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define x first
#define y second
ll N;
ll A[200005];
ll L[200005];
ll R[200005];
ll Del[200005];
int main(){
cin.tie(0) -> sync_with_stdio(false);
cin >> N;
priority_queue<pair<ll, ll>> PQ;
for(int i = 1; i <= N; i++){
cin >> A[i];
PQ.push({A[i], i});
L[i] = i - 1, R[i] = i + 1;
}
A[0] = A[N + 1] = -1e15;
ll ans = 0;
for(int i = 1; i <= (N + 1) / 2; i++){
while(Del[PQ.top().y]) PQ.pop();
pair<ll, ll> T = PQ.top(); PQ.pop();
ans += T.x;
cout << ans << '\n';
Del[L[T.y]] = Del[R[T.y]] = 1;
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...