Submission #3063

#	Time	Username	Problem	Language	Result	Execution time	Memory
3063		yourID	올림픽 (KOI13_olympic)	C++98	100 / 100	0 ms	1100 KiB

olympic

#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 / 8
• Subtask 2: 12 / 12
• Subtask 3: 20 / 20
• Subtask 4: 25 / 25
• Subtask 5: 35 / 35