백준 1781 컵라면(c++)

https://www.acmicpc.net/problem/1781

1781번: 컵라면

<코드>

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

int main()
{
	int n;
	cin>>n;
	vector<pair<int,int>>v;
	priority_queue<int,vector<int>,greater<int>>pq;
	for(int i=0;i<n;i++)
	{
		int a,b;
		cin>>a>>b;
		v.push_back(make_pair(a,b));
	}
	sort(v.begin(),v.end());
	long long sum = 0;

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