코딩테스트 백준 - 21939 문제 추천 시스템 Version 1

#include <stdio.h>
#include <iostream>

#include <string>

#include <queue>
#include <map>

using namespace std;

struct Backjoon
{
	int index;
	int difficulty;
};

struct CompareMin
{
	bool operator()(const Backjoon& lValue, const Backjoon& rValue)
	{
		if (lValue.difficulty == rValue.difficulty)
		{
			return lValue.index > rValue.index;
		}
		return lValue.difficulty > rValue.difficulty;
	}
};

struct CompareMax
{
	bool operator()(const Backjoon& lValue, const Backjoon& rValue)
	{
		if (lValue.difficulty == rValue.difficulty)
		{
			return lValue.index < rValue.index;
		}
		return lValue.difficulty < rValue.difficulty;
	}
};

map<int, bool> bIsSolved;
map<int, int> newBackjoon;
priority_queue<Backjoon, vector<Backjoon>, CompareMin> minPQ;
priority_queue<Backjoon, vector<Backjoon>, CompareMax> maxPQ;

void Add(const Backjoon& value)
{
	minPQ.push(value);
	maxPQ.push(value);
	newBackjoon[value.index] = value.difficulty;
	bIsSolved[value.index] = false;
}

void Solved(const int& index)
{
	bIsSolved[index] = true;
}

void Recommend(const int& temp)
{
	bool bIsEnd = false;
	if (temp == 1)
	{
		while (!bIsEnd)
		{
			Backjoon max = maxPQ.top();
			if (bIsSolved[max.index] == true)
			{
				maxPQ.pop();
			}
			else
			{
				printf("%d\n", max.index);
				bIsEnd = true;
				return;
			}
		}
	}
	else
	{
		while (!bIsEnd)
		{
			Backjoon min = minPQ.top();
			if (bIsSolved[min.index] == true)
			{
				minPQ.pop();
			}
			else
			{
				printf("%d\n", min.index);
				bIsEnd = true;
				return;
			}
		}
	}
}

int main()
{
	int N;
	cin >> N;
	for (int i = 0; i < N; i++)
	{
		Backjoon temp;
		cin >> temp.index >> temp.difficulty;
		Add(temp);
	}

	int M;
	cin >> M;
	for (int i = 0; i < M; i++)
	{
		string str;
		cin >> str;
		if (str[0] == 'a')
		{
			int index, difficulty;
			cin >> index >> difficulty;
			Add({ index, difficulty });
		}
		else if (str[0] == 's')
		{
			int index;
			cin >> index;
			Solved(index);
		}
		else if (str[0] == 'r')
		{
			int index;
			cin >> index;
			Recommend(index);
		}
	}
}