제출 #572545

#제출 시각아이디문제언어결과실행 시간메모리
572545Jesus휴가 (IOI14_holiday)C++14
23 / 100
16 ms2708 KiB
#include"holiday.h"
#include<bits/stdc++.h>

using namespace std;

priority_queue<long long int> caso2;

long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
        long long int res=0,aux=0;
        for(int i=0;i<n;i++){
            if(d==0){
                aux-=(caso2.top()*-1);
                caso2.pop();
                d++;
            }
            aux+=attraction[i];
            res=max(res,aux);
            caso2.push(attraction[i]*-1);
            d--;
            if(d==0){
                aux-=(caso2.top()*-1);
                caso2.pop();
            }
            else d--;
        }
        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...