[백준 8979번] 올림픽

소스코드

---

#include <iostream>
using namespace std;
 
int main() {
    int result=1, n, k, destIdx, d[4][1001];
    cin >> n >> k;
    for (int i = 0; i < n; i++) { 
        cin >> d[0][i] >> d[1][i] >> d[2][i] >> d[3][i];
        if (d[0][i] == k) { destIdx = i; }
    }
    
    for (int i = 0; i < n; i++) {
        if (d[1][destIdx] < d[1][i]) { result++; d[1][i] = -1, d[2][i] = -1, d[3][i] = -1; }
    }
    for (int i = 0; i < n; i++) {
        if (d[2][destIdx] < d[2][i] && d[1][destIdx] <= d[1][i]) { result++; d[1][i] = -1, d[2][i] = -1, d[3][i] = -1; }
    }
    for (int i = 0; i < n; i++) {
        if (d[3][destIdx] < d[3][i] && d[2][destIdx] <= d[2][i] && d[1][destIdx] <= d[1][i]) {
            result++; d[1][i] = -1, d[2][i] = -1, d[3][i] = -1; 
        }
    }
    cout << result << '\n';
    return 0;
}