0分,全RE

P1051 [NOIP2005 提高组] 谁拿了最多奖学金

这个这个 明明这题做对了 怎么我就看不懂了
by yutiangaojubileizhen @ 2023-10-06 20:00:40


楼主不出声???
by yutiangaojubileizhen @ 2023-10-06 20:06:42


有可能: 1:数组开太小 2:/0,%0
by ljhtomorrow @ 2023-10-06 20:06:56


帮你改好了,自己看 ``` #include<bits/stdc++.h> using namespace std; int b[1000]; struct xxs{ string m; int qm,bj; char g,x; int lw,q=0,xh; }tx[101]; int c=0; bool cmp(xxs a1,xxs a2){ if(a1.q==a2.q)return a1.xh<a2.xh; else return a1.q>a2.q; } int main(){ int i,n,c=0; cin>>n; for(i=1;i<=n;++i){ tx[i].xh=i; cin>>tx[i].m>>tx[i].qm>>tx[i].bj>>tx[i].g>>tx[i].x>>tx[i].lw; b[i]=0; if(tx[i].qm>80&&tx[i].lw>=1){ tx[i].q+=8000; } if(tx[i].qm>85&&tx[i].bj>80){ tx[i].q+=4000; } if(tx[i].x=='Y'&&tx[i].qm>85){ tx[i].q+=1000; } if(tx[i].qm>90){ tx[i].q+=2000; } if(tx[i].g=='Y'&&tx[i].bj>80){//注意这里是g不是x tx[i].q+=850; } c+=tx[i].q; } sort(tx+1,tx+n,cmp); cout<<tx[1].m<<endl<<tx[1].q<<endl<<c; return 0; } ```
by flh2011 @ 2023-10-11 20:26:34


和我思路一样
by zhangjiaye1 @ 2023-10-14 21:21:30


@[flh2011](/user/1023561) 谢谢,已过
by 123uuu @ 2023-10-19 12:53:23


此贴完结
by 123uuu @ 2023-10-19 12:54:14


|