Submission #5644

#TimeUsernameProblemLanguageResultExecution timeMemory
5644tncks0121덩치 (KOI13_body)C++98
18 / 18
0 ms1676 KiB
#include <stdio.h> #include <stdlib.h> #include <string.h> #include <math.h> #include <limits.h> #include <bits/stdc++.h> #include <memory.h> typedef long long ll; typedef unsigned long long llu; typedef double lf; typedef long double llf; typedef unsigned int uint; using namespace std; const int N_ = 55; int N, A[N_], B[N_]; int main() { scanf("%d", &N); for(int i = 1; i <= N; i++) scanf("%d%d", A+i, B+i); for(int i = 1; i <= N; i++) { int v = 1; for(int j = 1; j <= N; j++) { if(A[j] > A[i] && B[j] > B[i]) ++v; } printf("%d%c", v, (i < N) ? ' ' : '\n'); } 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...