제출 #4475

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
4475	2013-10-08 02:25:10	gs13068	올림픽 (KOI13_olympic)	C++98	100 / 100	0 ms	1104 KiB

olympic

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
#include<cstdio>
int a[1000][4];
int main()
{
  int i,j,n,k;
  scanf("%d%d",&n,&k);
  for(i=0;i<n;i++)for(j=0;j<4;j++)scanf("%d",&a[i][j]);
  for(i=0;i<n;i++)if(a[i][0]==k)break;
  k=1;
  for(j=0;j<n;j++)
  {
    if(a[j][1]>a[i][1])k++;
    else if(a[j][1]==a[i][1]&&a[j][2]>a[i][2])k++;
    else if(a[j][1]==a[i][1]&&a[j][2]==a[i][2]&&a[j][3]>a[i][3])k++;
  }
  printf("%d",k);
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 12 / 12
• Subtask 3: 20 / 20
• Subtask 4: 25 / 25
• Subtask 5: 35 / 35