C++ (코딩테스트) - 컵라면(백준) 우선순위 큐 사용

문제

 

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

1781번: 컵라면

 

내가 푼 코드

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

bool mysort(const pair<int, int>& a,
	const pair<int, int>& b)
{
	if(a.first == b.first)
		return (a.second > b.second);
	else
		return (a.first < b.first);
}

int main() {
	int N, S, E;
	cin >> N;

	vector<pair<int, long long int>> v(N);
	priority_queue<long long int, vector<long long int>, greater<long long int>> con;

	for (int i = 0; i < N; i++)
	{
		cin >> S >> E;
		v[i] = make_pair(S, E);
	}	

	sort(v.begin(), v.end(), mysort);

	int num = 0;
	for (int i = 0; i < N; i++)
	{
		if (v[i].first > num)
		{
			num = v[i].first;
		}
		else
		{
			continue;
		}

		for (int j = i; j < i + num; j++)
		{
			if(j == N)
				break;

			if (num == v[j].first)
			{
				int con_size = con.size();
				if (con_size < num)
				{
					con.emplace(v[j].second);
				}
				else
				{
					if (con.top() < v[j].second)
					{
						con.pop();
						con.emplace(v[j].second);
					}
					else
					{
						i = j;
						break;
					}
				}
			}
			else
			{
				i = j - 1;
				break;
			}
		}
	}

	int sum = 0;
	while (!con.empty())
	{
		sum += con.top();
		con.pop();
	}

	cout << sum << endl;
	return 0;
}