嘤嘤，80分求调

80分代码```cpp #include #include using namespace std; int n,sum; struct stu{ string n; char xs,xb; int sc1,sc2,l,j,id; }a[105]; bool cmp(stu x,stu y) { if(x.j==y.j) { return x.id>y.id; } return x.j>y.j; } int main() { cin>>n; for(int i=1;i<=n;i++) { cin>>a[i].n>>a[i].sc1>>a[i].sc2>>a[i].xs>>a[i].xb>>a[i].l; a[i].id=i; if(a[i].sc1>80&&a[i].l>=1) { a[i].j+=8000; sum+=8000; } if(a[i].sc1>85&&a[i].sc2>80) { a[i].j+=4000; sum+=4000; } if(a[i].sc1>90) { a[i].j+=2000; sum+=2000; } if(a[i].sc1>85&&a[i].xb=='Y') { a[i].j+=1000; sum+=1000; } if(a[i].sc2>80&&a[i].xs=='Y') { a[i].j+=850; sum+=850; } } sort(a+1,a+n+1,cmp); cout<<a[1].n<<endl<<a[1].j<<endl<<sum; return 0; }