This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <algorithm>
struct S {
int a, b, c;
bool operator< (const S &t) const {
if(a != t.a) return a > t.a;
if(b != t.b) return b > t.b;
return c > t.c;
}
} D[1005], W;
int N, K;
int main() {
int i, j;
scanf("%d%d", &N, &K);
for(i = 1; i <= N; i++) {
//scanf("%d", &j);
scanf("%d%d%d", &D[i].a, &D[i].b, &D[i].c);
}
W = D[K];
std::sort(D+1, D+N+1);
for(i = 1; i <= N; i++) {
if(D[i].a == W.a && D[i].b == W.b && D[i].c == W.c) {
printf("%d\n", i);
return 0;
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |