Submission #1111

#TimeUsernameProblemLanguageResultExecution timeMemory
1111skstmdvlf덩치 (KOI13_body)C++98
18 / 18
0 ms884 KiB
#include<stdio.h> int main() { int a[2][51], b[51], i, j, n; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %d",&a[0][i],&a[1][i]); } for(i=0;i<n;i++) { b[i]=n; } for(i=0;i<n;i++) { for(j=0;j<n;j++) { if(a[0][i]>=a[0][j] || a[1][i]>=a[1][j]) { b[i]--; } } } for(i=0;i<n;i++) { printf("%d ",b[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...