제출 #217245

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

using namespace std;

long long int ans, sum = 0;
priority_queue<int, vector<int>, greater<int> > pq;

long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
	
	for(int i = 0; i <= d && i < n; i++){
		sum += attraction[i];
		pq.push(attraction[i]);

		while(pq.size() > d - i) sum -= pq.top(), pq.pop();

		ans = max(ans, sum);
	}

    return ans;
}

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

holiday.cpp: In function 'long long int findMaxAttraction(int, int, int, int*)':
holiday.cpp:15:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(pq.size() > d - i) sum -= pq.top(), pq.pop();
         ~~~~~~~~~~^~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...