如果就直接开四个长度[100000]struct数组有两个测试点会超时。。。还是要用vector
错误示范：
#include
#include
#include
#include

struct DCL
{
string name;
int de=0;
int cai=0;
}a[100000],b[100000],c[100000],d[100000];//会超时

bool cmp(DCL a,DCL b)
{
if((a.de+a.cai)!=(b.de+b.cai))
return (a.de+a.cai)>(b.de+b.cai);
else if(a.de!=b.de)
return a.de>b.de;
else
return a.name<b.name;
}

int main()
{
int n;
cin>>n;
int total=n;
int l,h;
cin>>l>>h;
int numa=0,numb=0,numc=0,numd=0;
for(int i=0;i<n;i++)
{
string name;
cin>>name;
int de,cai;
cin>>de>>cai;
if(de<l||cai<l)
total–;
else if(de>=h&&cai>=h)
{

        a[numa].name=name;a[numa].de=de;a[numa].cai=cai;numa++;}else if(de>=h&&cai<h){b[numb].name=name;b[numb].de=de;b[numb].cai=cai;numb++;}else if(de<h&&cai<h&&de>=cai){c[numc].name=name;c[numc].de=de;c[numc].cai=cai;numc++;}else{d[numd].name=name;d[numd].de=de;d[numd].cai=cai;numd++;}
}sort(a,a+numa,cmp);
sort(b,b+numb,cmp);
sort(c,c+numc,cmp);
sort(d,d+numd,cmp);
cout<<total<<endl;
for(int i=0;i<numa;i++)
{cout<<a[i].name<<" "<<a[i].de<<" "<<a[i].cai<<endl;
}
for(int i=0;i<numb;i++)
{cout<<b[i].name<<" "<<b[i].de<<" "<<b[i].cai<<endl;
}
for(int i=0;i<numc;i++)
{cout<<c[i].name<<" "<<c[i].de<<" "<<c[i].cai<<endl;
}
for(int i=0;i<numd;i++)
{cout<<d[i].name<<" "<<d[i].de<<" "<<d[i].cai<<endl;
}return 0;

}

用了vector后
#include
#include
#include
#include

struct DCL
{
int name;
int de=0;
int cai=0;
};

int cmp(struct DCL a,struct DCL b)
{
if((a.de+a.cai)!=(b.de+b.cai))
return (a.de+a.cai)>(b.de+b.cai);
else if(a.de!=b.de)
return a.de>b.de;
else
return a.name<b.name;
}

int main()
{
int n;
cin>>n;
int total=n;
int l,h;
cin>>l>>h;
int numa=0,numb=0,numc=0,numd=0;
vectorv[4];
DCL temp;
for(int i=0;i<n;i++)
{
int name;
cin>>name;
int de,cai;
cin>>de>>cai;
temp.name=name;
temp.de=de;
temp.cai=cai;
if(de<l||cai<l)
total–;
else if(de>=h&&cai>=h)
{
v[0].push_back(temp);
}
else if(de>=h&&cai<h)
{
v[1].push_back(temp);
}
else if(de<h&&cai<h&&de>=cai)
{
v[2].push_back(temp);
}
else
{
v[3].push_back(temp);
}
}

cout<<total<<endl;
sort(v[0].begin(),v[0].end(),cmp);
sort(v[1].begin(),v[1].end(),cmp);
sort(v[2].begin(),v[2].end(),cmp);
sort(v[3].begin(),v[3].end(),cmp);
for (int i = 0; i < 4; i++)
for (int j = 0; j < v[i].size(); j++)printf("%d %d %d\n", v[i][j].name, v[i][j].de, v[i][j].cai);return 0;

}