Sign in $ create-account
~/problems ~/discussion ~/contests ~/submission
← ~/submission
run #1464 Wrong Answer P1001 · 谁拿了最多奖学金
Time 59 ms Memory 1104 K Lang C
// Judge Result
Compile Successfully. - Test Point #0: Wrong Answer, Time = 3 ms, Memory = 1096 KB, Score = 0 - Test Point #1: Wrong Answer, Time = 13 ms, Memory = 1084 KB, Score = 0 - Test Point #2: Wrong Answer, Time = 10 ms, Memory = 1036 KB, Score = 0 - Test Point #3: Wrong Answer, Time = 11 ms, Memory = 936 KB, Score = 0 - Test Point #4: Wrong Answer, Time = 5 ms, Memory = 1104 KB, Score = 0 - Test Point #5: Wrong Answer, Time = 3 ms, Memory = 1096 KB, Score = 0 - Test Point #6: Wrong Answer, Time = 4 ms, Memory = 1028 KB, Score = 0 - Test Point #7: Wrong Answer, Time = 3 ms, Memory = 1068 KB, Score = 0 - Test Point #8: Wrong Answer, Time = 4 ms, Memory = 1032 KB, Score = 0 - Test Point #9: Wrong Answer, Time = 3 ms, Memory = 968 KB, Score = 0 Wrong Answer, Time = 59 ms, Memory = 1104 KB, Score = 0
// Source
#include<stdio.h>
#include<string.h>
struct 
{
    char name[22];
    int qimo;
    int banyi;
    char bangan;
    char xibu;
    int lunwen;
    int jiangjin;
}data[110];
int main()
{
    int n,x;
    int i,tsum,t,k;
    scanf("%d",&n);
    while(n--)
    {

        scanf("%d",&x);
        for(i=0;i<x;i++)
            data[i].jiangjin=0;
        for(i=0;i<x;i++)
            scanf("%s %d%d %c %c %d",data[i].name,&data[i].qimo,&data[i].banyi,&data[i].bangan,&data[i].xibu,&data[i].lunwen);
        for(i=0;i<x;i++)
        {
            if(data[i].qimo>80&&data[i].lunwen>=1)
                data[i].jiangjin+=8000;
            if(data[i].qimo>85&&data[i].banyi>80)
                data[i].jiangjin+=4000;
            if(data[i].qimo>90)
                data[i].jiangjin+=2000;
            if(data[i].qimo>85&&data[i].xibu=='Y')
                data[i].jiangjin+=1000;
            if(data[i].banyi>80&&data[i].bangan=='Y')
                data[i].jiangjin+=850;
        }
        t=-1;
        tsum=0;
        for(i=0;i<x;i++)
        {
            tsum+=data[i].jiangjin;
            if(t<data[i].jiangjin)
            {
                t=data[i].jiangjin;
                k=i;
            }
        }
        printf("%s\n%d\n%d\n",data[k].name,data[k].jiangjin,tsum);
    }
    return 0;
}
length 1295 B
Wrong Answer
Judge Result
Run ID#1464
ProblemP1001
Submitted byiwiiwi
LanguageC
Used Time59 ms
Used Memory1104 K
Code length1295 B
Submit TimeFebruary 4, 2020, 2:41:42 PM
Execute TimeFebruary 4, 2020, 2:41:33 PM
// Judger
C
View Problem