oj.uz

Submission #2967

# Submission time Handle Problem Language Result Execution time Memory
2967 2013-08-19T06:54:27 Z tncks0121 올림픽 (KOI13_olympic) C++
100 / 100
 0 ms 1100 KB 
#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[j].a, &D[j].b, &D[j].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;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1100 KB Output is correct
2 Correct 0 ms 1100 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1100 KB Output is correct
2 Correct 0 ms 1100 KB Output is correct
3 Correct 0 ms 1100 KB Output is correct
4 Correct 0 ms 1100 KB Output is correct
5 Correct 0 ms 1100 KB Output is correct
6 Correct 0 ms 1100 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1100 KB Output is correct
2 Correct 0 ms 1100 KB Output is correct
3 Correct 0 ms 1100 KB Output is correct
4 Correct 0 ms 1100 KB Output is correct
5 Correct 0 ms 1100 KB Output is correct
6 Correct 0 ms 1100 KB Output is correct
7 Correct 0 ms 1100 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1100 KB Output is correct
2 Correct 0 ms 1100 KB Output is correct
3 Correct 0 ms 1100 KB Output is correct
4 Correct 0 ms 1100 KB Output is correct
5 Correct 0 ms 1100 KB Output is correct
6 Correct 0 ms 1100 KB Output is correct
7 Correct 0 ms 1100 KB Output is correct
8 Correct 0 ms 1100 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1100 KB Output is correct
2 Correct 0 ms 1100 KB Output is correct
3 Correct 0 ms 1100 KB Output is correct
4 Correct 0 ms 1100 KB Output is correct
5 Correct 0 ms 1100 KB Output is correct
6 Correct 0 ms 1100 KB Output is correct
7 Correct 0 ms 1100 KB Output is correct
8 Correct 0 ms 1100 KB Output is correct
9 Correct 0 ms 1100 KB Output is correct