제출 #763657

#제출 시각아이디문제언어결과실행 시간메모리
763657Ahmed57휴가 (IOI14_holiday)C++17
23 / 100
13 ms2020 KiB
#include"holiday.h"

#include <bits/stdc++.h>

using namespace std;
long long int findMaxAttraction(int n, int start, int d,
int attraction[]){
    if(start==0){
        priority_queue<long long> q;
        long long sum = 0 , ma = 0;
        for(int i = 0;i<n;i++){
            q.push(-attraction[i]);
            sum+=attraction[i];
            while(!q.empty()&&q.size()>(d-i)){
                sum+=q.top();
                q.pop();
            }
            ma = max(ma,sum);
        }
        return ma;
    }
    return 0;
}
/*
int main(){
    int S[] = {3,4};
    cout<<countReplacement(2,S);
}*/

컴파일 시 표준 에러 (stderr) 메시지

holiday.cpp: In function 'long long int findMaxAttraction(int, int, int, int*)':
holiday.cpp:14:39: warning: comparison of integer expressions of different signedness: 'std::priority_queue<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   14 |             while(!q.empty()&&q.size()>(d-i)){
      |                               ~~~~~~~~^~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...