90分，样例过了 最后一个点wa,请各位大佬挑错

上代码

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
using namespace std;
struct xuesheng 
{
   string ming;
   int yu,shu,ying;
   long long zong=0,haoma;
}c[10020];
int d(struct xuesheng c,struct xuesheng b)
{
    if(c.zong=b.zong)
    {
        return c.zong<b.zong;
    }
    else
    {
        return c.zong>b.zong;
    }
}
int main()
{
  int n,xia;
  long long maxz=0;
  cin>>n;

  for(int i=1;i<=n;i++)
  {
    cin>>c[i].ming>>c[i].yu>>c[i].shu>>c[i].ying;
    c[i].zong=c[i].shu+c[i].yu+c[i].ying; 
  }
  for(int i=0;i<n;i++)
  {
    if(c[i].zong>maxz)
    {
        maxz=c[i].zong;
        xia=i;
    }

  }
  cout<<c[xia].ming<<" "<<c[xia].yu<<" "<<c[xia].shu<<" "<<c[xia].ying<<endl;
  return 0;

}

样例过了 最后一个点wa