求救：为什么90分？？？

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
struct EX {
       string name;
       int qp,bp;
       char xg,xs;
       int lw;
       int zf;
}e[105];
bool cmp (EX x,EX y)
{
     return x.zf>y.zf;
}
int main ()
{
    //freopen ("P1051.in","r",stdin);
    //freopen ("P1051.out","w",stdout);
    int n;
    cin>>n;
    for (int i=0;i<n;i++)
    cin>>e[i].name>>e[i].qp>>e[i].bp>>e[i].xg>>e[i].xs>>e[i].lw;
    for (int i=0;i<n;i++)
    {
        if (e[i].qp>80 && e[i].lw>=1) e[i].zf+=8000;
        if (e[i].qp>85 && e[i].bp>80) e[i].zf+=4000;
        if (e[i].qp>90) e[i].zf+=2000;
        if (e[i].qp>85 && e[i].xs=='Y') e[i].zf+=1000;
        if (e[i].bp>80 &&e[i].xg=='Y') e[i].zf+=850;
    }
    sort (e,e+n,cmp);
    cout<<e[0].name<<endl<<e[0].zf<<endl;
    int ans=0;
    for (int i=0;i<n;i++)
    ans+=e[i].zf;
    cout<<ans<<endl;
    return 0;
}