출전 순서 정하기(MATCHORDER) 정답 코드

문제를 보시려면 여기를 클릭

이하는 코드입니다.

#include <stdio.h>
#include <queue>
 
#pragma warning(disable:4996)
 
using namespace std;
 
struct MaxCompare {
    bool operator() (const int left, const int right) {
        return left < right;
    }
};
 
int main() {
    int C;
    scanf("%d\n", &C);
 
    for (int i = 0; i < C; i++) {
        int N;
        scanf("%d", &N);
 
        priority_queue<int, vector<int>, MaxCompare> maxHeap_enemy;
        for (int j = 0; j < N; j++) {
            int *enemyRating = new int;
            scanf("%d", enemyRating);
            maxHeap_enemy.push(*enemyRating);
        }
 
        priority_queue<int, vector<int>, MaxCompare> maxHeap_korea;
        for (int j = 0; j < N; j++) {
            int *koreanRating = new int;
            scanf("%d", koreanRating);
            maxHeap_korea.push(*koreanRating);
        }
 
        int winCount = 0;
        while (true) {
            if (maxHeap_enemy.size() < 1) {
                break;
            }
 
            // cannot defeat
            if (maxHeap_enemy.top() > maxHeap_korea.top()) {
                maxHeap_enemy.pop();
                continue;
            }
 
            // can defeat
            winCount++;
            maxHeap_enemy.pop();
            maxHeap_korea.pop();
        }
 
        printf("%d\n", winCount);
    }
 
    return 0;
}