제출 #777551

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
777551		a_aguilo	Sails (IOI07_sails)	C++14	40 / 100	1075 ms	2476 KiB

sails

#include<bits/stdc++.h>

using namespace std;

int N;
long long ans;
const int maxN = 100002;
const int maxH = 100002;
pair<int, int> masts[maxN];

int main(){
	ans = 0;
	cin >> N;
	for(int i = 0; i < N; ++i) cin >> masts[i].first >> masts[i].second;
	priority_queue<int> PQ;
	sort(masts, masts+N);
	for(int i = 0; i < N; ++i){
		int h = masts[i].first;
		int k = masts[i].second;
		queue<int> sails;
		while(PQ.size() < h)PQ.push(0);
		for(int j = 0; j < k; ++j){
			int pos = -PQ.top(); PQ.pop();
			sails.push(pos+1);
			ans += pos;
		}
		while(!sails.empty()){
			PQ.push(-sails.front()); sails.pop();
		}
	}
	cout << ans << endl;
	return 0;
}

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

sails.cpp: In function 'int main()':
sails.cpp:21:19: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   21 |   while(PQ.size() < h)PQ.push(0);
      |         ~~~~~~~~~~^~~

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10
• Subtask 11: 0 / 10