可以sort一下
by Missdie @ 2023-11-11 10:39:06
@[Missdie](/user/995040)
输出只输出样例的第二行
by panrong @ 2023-11-11 20:15:35
@[Missdie](/user/995040)
样例能过了，但爆0
```
#include <bits/stdc++.h>
using namespace std;
struct student{
string name;
int yw,sx,yy,s;
};
bool paixv(student c,student b){
return c.name<b.name;
}
int main(){
int n;
cin>>n;
student a[n+1];
for(int i=n;i>0;i--){
cin>>a[i].name>>a[i].yw>>a[i].sx>>a[i].yy;
a[i].s=a[i].yw+a[i].sx+a[i].yy;
}
sort(a+1,a+n+1,paixv);
for(int i=1;i<=n;i++){
for(int j=1;j<i;j++){
if(abs(a[i].yw-a[j].yw<=5)&&abs(a[i].sx-a[j].sx<=5)&&abs(a[i].yy-a[j].yy<=5)&&abs(a[i].s-a[j].s<=10)){
cout<<a[j].name<<" "<<a[i].name<<"\n";
}
}
}
return 0;
}
by panrong @ 2023-11-16 17:10:26
按名字排序？ @[panrong](/user/1044970)
by Missdie @ 2023-11-16 17:15:32
@[Missdie](/user/995040) 改了一下代码，还是爆零
```
#include <bits/stdc++.h>
using namespace std;
struct student{
string name;
int yw,sx,yy,s;
};
bool paixv(student c,student b){
return c.name<b.name;
}
int main(){
int n;
cin>>n;
student a[n+1];
for(int i=n;i>0;i--){
cin>>a[i].name>>a[i].yw>>a[i].sx>>a[i].yy;
a[i].s=a[i].yw+a[i].sx+a[i].yy;
}
sort(a+1,a+n+1,paixv);
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
if(abs(a[i].yw-a[j].yw<=5)&&abs(a[i].sx-a[j].sx<=5)&&abs(a[i].yy-a[j].yy<=5)&&abs(a[i].s-a[j].s<=10)){
cout<<a[i].name<<" "<<a[j].name<<"\n";
}
}
}
return 0;
}
by panrong @ 2023-11-16 17:18:29
@[panrong](/user/1044970) 按总分排序啊
by Missdie @ 2023-11-16 17:18:47
@[panrong](/user/1044970) 对不起不需要sort。。。。。。
```cpp
#include <bits/stdc++.h>
using namespace std;
struct student{
string name;
int yw,sx,yy,s;
}a[1005];
int main(){
int n;
cin>>n;
for(int i = 1; i <= n; ++ i){
cin>>a[i].name>>a[i].yw>>a[i].sx>>a[i].yy;
a[i].s=a[i].yw+a[i].sx+a[i].yy;
}
for(int i=1;i<n;i++){
for(int j=i+1;j<=n;j++){
if(abs(a[i].yw-a[j].yw)<=5&&abs(a[i].sx-a[j].sx)<=5&&abs(a[i].yy-a[j].yy)<=5&&abs(a[i].s-a[j].s)<=10){
cout<<a[i].name<<" "<<a[j].name<<endl;
}
}
}
return 0;
}
```
by Missdie @ 2023-11-16 18:36:15