[백준] 1781번: 컵라면

1781번: 컵라면

 

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

int main() {
	int n;
	pair<int, int>p[MAX];
	priority_queue<int,vector<int>,greater<int>>pq;

	cin >> n;
	for (int i = 0;i < n;i++) {
		cin >> p[i].first >> p[i].second;
	}

	sort(p, p + n);

	for (int i = 0;i < n;i++) {
		if (pq.size() < p[i].first) {
			pq.push(p[i].second);
		}
		else {
			if (pq.top() < p[i].second) {
				pq.pop();
				pq.push(p[i].second);
			}
		}
	}
	
	int sum = 0;
	while (!pq.empty()) {
		sum += pq.top();
		pq.pop();
	}

	cout<< sum;
}