제출 #875416

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
875416		lalig777	Hotel (CEOI11_hot)	C++14	30 / 100	821 ms	29396 KiB

hot

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;

int main(){
	int n, m, o;
	priority_queue<int>pq;
	cin>>n>>m>>o;
	vector<pair<int,int> >habitacions(n);
	vector<int>max_prof(n, 0);
	vector<pair<int,int> >offers(m);
	for (int i=0; i<n; i++) cin>>habitacions[i].first>>habitacions[i].second;
	sort(habitacions.begin(), habitacions.end());
	for (int i=0; i<m; i++) cin>>offers[i].second>>offers[i].first;
	sort(offers.begin(), offers.end());
	int k=0;
	for (int i=0; i<n; i++){
		int max_people=habitacions[i].second;
		for (int j=k; j<m; j++){
			if (offers[j].first<=max_people) pq.push(offers[j].second);
			else{
				k=j;
				break;
			}if (j==m-1) k=m;
		}if (!pq.empty()){
			max_prof[i]=pq.top()-habitacions[i].first;
			pq.pop();
		}
	}sort(max_prof.begin(), max_prof.end());
	long long int ans=0;
	for (int i=n-1; i>=n-o; i--) ans+=max_prof[i];
	cout<<ans<<endl;
	return 0;
}

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