Submission #10073

#	Time	Username	Problem	Language	Result	Execution time	Memory
10073		gs14004	올림픽 (KOI13_olympic)	C++98	100 / 100	0 ms	1104 KiB

olympic

#include <cstdio>
#include <algorithm>
using namespace std;

struct x{int a,g,s,b;}a[1005];
bool cmp(x a, x b){return a.g != b.g ? a.g > b.g : (a.s != b.s ? a.s > b.s : a.b > b.b);}
bool operator==(x a, x b){ return a.g == b.g && a.s == b.s && a.b == b.b; }

int main(){
    int n,k;
    scanf("%d %d",&n,&k);
    for (int i=0; i<n; i++) {
        scanf("%d %d %d %d",&a[i].a,&a[i].g,&a[i].s,&a[i].b);
    }
    sort(a,a+n,cmp);
    x piv;
    for (int i=0; i<n; i++) {
        if(a[i].a == k) piv = a[i];
    }
    for (int i=0; i<n; i++) {
        if(piv == a[i]){
            printf("%d",i+1);
            return 0;
        }
    }
}

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