백준 7568 : 덩치

문제 링크입니다 https://www.acmicpc.net/problem/7568

7568번: 덩치

// [Brute Force] 백준(7568) : 덩치
 
#include<cstdio>
const int MAX = 50 + 10;
 
int n, dungChi[MAX][2];
 
void solve(void) {
    int Rank[MAX] = { 0, };
    for (int t = 0; t < n; t++) {
        for (int i = 0; i < n; i++) {
            int x = dungChi[t][0], y = dungChi[t][1];
            
            if (i != t && dungChi[i][0] > x && dungChi[i][1] > y) {
                Rank[t]++;
            }
            else continue;
        }
    }
    for (int i = 0; i < n; i++) {
        printf("%d ", Rank[i] + 1);
    }
}
 
int main(void) {
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 2; j++) {
            scanf("%d", &dungChi[i][j]);
        }
    }
    solve();
    return 0;
}