제출 #4577

#제출 시각아이디문제언어결과실행 시간메모리
4577KH_Lee0415덩치 (KOI13_body)C++98
18 / 18
0 ms1088 KiB
#include<stdio.h>
int wl[100][3];
int res[100];
int main(){
    int N, i, j;
    scanf("%d", &N);
    for(i=1; i<=N; i++) scanf("%d %d", &wl[i][1], &wl[i][2]);
    for(i=1; i<=N; i++){
        for(j=1; j<=N; j++) if(wl[i][1]<wl[j][1] && wl[i][2]<wl[j][2]) res[i]++;
        printf("%d ", res[i]+1);
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...