# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
16850 | hjk0553 | 올림픽 (KOI13_olympic) | C11 | 0 ms | 1084 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<stdio.h>
int main()
{
int i,n,k,gold[1001],silver[1001],bronze[1001],sunwe=0;
scanf("%d %d",&n,&k);
for(i=1;i<=n;i++)
{
int num;
scanf("%d",&num);
scanf("%d %d %d",&gold[num],&silver[num],&bronze[num]);
}
for(i=1;i<=n;i++)
{
if(gold[k]<gold[i])
{
sunwe++;
}
else if(gold[k]==gold[i])
{
if(silver[k]<silver[i])
{
sunwe++;
}
else if(silver[i]==silver[k])
{
if(bronze[k]<bronze[i])
{
sunwe++;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |