[백준 7568] 덩치

#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
vector<pair<int,pair<int,int>>> v;
int n,a,b,cnt;
void func(){
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            if(i==j)
                continue;
            if(v[i].second.first<v[j].second.first && v[i].second.second<v[j].second.second){
                v[i].first++;
                
            }
        }
    }
}
int main(void){
    scanf("%d", &n);
    for(int i=0; i<n; i++){
        scanf("%d %d", &a, &b);
        
        v.push_back(make_pair(1,make_pair(a,b)));
    }
 
    func();
    
    for(int i=0; i<n; i++)
        printf("%d\n", v[i].first);
    
    return 0;
}

- JAVA

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.StringTokenizer;
 
public class Main{
    public static void main(String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringBuffer sb = new StringBuffer();
 
        int n = Integer.parseInt(br.readLine());
        int[][] arr = new int[n][2];
 
        for(int i=0; i<n; i++){
            String str = br.readLine();
            StringTokenizer st = new StringTokenizer(str," ");
 
            arr[i][0]=Integer.parseInt(st.nextToken());
            arr[i][1]=Integer.parseInt(st.nextToken());
        }
 
        for(int i=0; i<n; i++){
            int ans=1;
 
            for(int j=0; j<n; j++){
                if(i==j) continue;
 
                if(arr[i][0]<arr[j][0] && arr[i][1]<arr[j][1])
                    ans++;
            }
 
            sb.append(ans).append(" ");
        }
 
        System.out.print(sb);
    }
}