未经允许禁止转载
问题:
问题原地址:http://acm.sdut.edu.cn/onlinejudge2/index.php/Home/Contest/contestproblem/cid/2783/pid/4202
代码:
#include <stdio.h>
#include <stdlib.h>
struct sdut
{
int w1,w2,w3;
double sum;
}sb [5001],t;
int main()
{
int n,i;
while(scanf("%d",&n)!=EOF)
{
for(i=0;i<=n-1;i++)
{
scanf("%d %d %d",&sb[i].w1,&sb[i].w2,&sb[i].w3);
sb[i].sum=sb[i].w10.7+sb[i].w20.2+sb[i].w3*0.1;
}
double max=sb[0].sum;
int p=0;
for(i=1;i<=n-1;i++)
{
if(st[i].sum>max)
{
max=sb[i].sum;
p=i;
}
}
printf("%d\n",p);
}
return 0;
}