下面是我的答案#include<stdio.h>int main(){ char a[100],b[100],c[100],Y; int e[100],f[100],g[100],h,i,j,k[100],z,x,temp,sum=0; for(i=0;i<h;i++) { scanf("%d%d%d%d%d%d",&h,&a[i],&e[i],&f[i],&b[i],&c[i
来源:学生作业帮助网 编辑:作业帮 时间:2024/07/06 12:21:21
![下面是我的答案#include<stdio.h>int main(){ char a[100],b[100],c[100],Y; int e[100],f[100],g[100],h,i,j,k[100],z,x,temp,sum=0; for(i=0;i<h;i++) { scanf("%d%d%d%d%d%d",&h,&a[i],&e[i],&f[i],&b[i],&c[i](/uploads/image/z/10371672-0-2.jpg?t=%E4%B8%8B%E9%9D%A2%E6%98%AF%E6%88%91%E7%9A%84%E7%AD%94%E6%A1%88%23include%26lt%3Bstdio.h%26gt%3Bint+main%28%29%7B+char+a%5B100%5D%2Cb%5B100%5D%2Cc%5B100%5D%2CY%3B+int+e%5B100%5D%2Cf%5B100%5D%2Cg%5B100%5D%2Ch%2Ci%2Cj%2Ck%5B100%5D%2Cz%2Cx%2Ctemp%2Csum%3D0%3B+for%28i%3D0%3Bi%26lt%3Bh%3Bi%2B%2B%29++%7B+++scanf%28%26quot%3B%25d%25d%25d%25d%25d%25d%26quot%3B%2C%26amp%3Bh%2C%26amp%3Ba%5Bi%5D%2C%26amp%3Be%5Bi%5D%2C%26amp%3Bf%5Bi%5D%2C%26amp%3Bb%5Bi%5D%2C%26amp%3Bc%5Bi)
下面是我的答案#include<stdio.h>int main(){ char a[100],b[100],c[100],Y; int e[100],f[100],g[100],h,i,j,k[100],z,x,temp,sum=0; for(i=0;i<h;i++) { scanf("%d%d%d%d%d%d",&h,&a[i],&e[i],&f[i],&b[i],&c[i
下面是我的答案
#include<stdio.h>
int main()
{
char a[100],b[100],c[100],Y;
int e[100],f[100],g[100],h,i,j,k[100],z,x,temp,sum=0;
for(i=0;i<h;i++)
{
scanf("%d%d%d%d%d%d",&h,&a[i],&e[i],&f[i],&b[i],&c[i],&g[i]);
}
for(j=0;j<h;j++)
{
k[j]=0;
\x05if(e[j]>80&&g[j]>=1)
\x05{k[j]=k[j]+8000;}
\x05if(e[j]>85&&f[j]>80)
\x05{k[j]=k[j]+4000;}
\x05if(e[j]>90)
\x05{k[j]=k[j]+2000;}
\x05if(e[j]>85&&c[j]==Y)
\x05{k[j]=k[j]+1000;}
\x05if(f[j]>80&&b[j]==Y)
\x05{k[j]=k[j]+850;}
}
for(z=0;z<h;h++)
{
if(k[z]>k[z+1])
{
a[z+1]=a[z];
temp=k[z];
\x05k[z]=k[z+1];
\x05k[z+1]=temp;
}
}
for(x=0;z<h;z++)
{
sum=sum+k[x];
}
printf("%d%d%d",a[h-1],k[h-1],sum);
return 0;
}
下面是我的答案#include<stdio.h>int main(){ char a[100],b[100],c[100],Y; int e[100],f[100],g[100],h,i,j,k[100],z,x,temp,sum=0; for(i=0;i<h;i++) { scanf("%d%d%d%d%d%d",&h,&a[i],&e[i],&f[i],&b[i],&c[i
#include
int main()
{
char a[100][21],b[100],c[100];
int e[100],f[100],g[100],h,i,k[100],max=0,sum=0;
scanf("%d",&h);
for(i=0;i80&&g[i]>=1) {k[i]=k[i]+8000;}
if(e[i]>85&&f[i]>80) {k[i]=k[i]+4000;}
if(e[i]>90) {k[i]=k[i]+2000;}
if(e[i]>85&&c[i]=='Y') {k[i]=k[i]+1000;}
if(f[i]>80&&b[i]=='Y') {k[i]=k[i]+850;}
if(k[i] > k[max])
max = i;
sum += k[i];
}
printf("%s\n%d\n%d",a[max],k[max],sum);
return 0;
}