Submission #5328

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

olympic

#include <stdio.h>
#include <algorithm>

using namespace std;

typedef pair <int,int> ppair;
pair <ppair,ppair> medal[1001];
int n, k, ans;

void input(void)
{
    int i, a, b, c, d;

    scanf("%d %d",&n,&k);
    for(i=1 ; i<=n ; i++)
    {
        scanf("%d %d %d %d",&a,&b,&c,&d);
        if(a==k)
            a=0;
        medal[i]=make_pair(make_pair(-b,-c),make_pair(-d,a));
    }
    sort(medal+1,medal+n+1);
}

void process(void)
{
    int i;

    for(i=1 ; i<=n ; i++)
        if(medal[i].second.second==0)
        {
            ans=i;
            break;
        }
}

void output(void)
{
    printf("%d",ans);
}

int main(void)
{
    input();
    process();
    output();

    return 0;
}

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