P5741 【深基7.例10】旗鼓相当的对手 - 加强版(C++)

#include<iostream>
#include <map>
#include <valarray>
#include <iomanip>
#include <vector>
#include <cstring>
using namespace std;
struct Student{
    string name;
    int yuwwen,shuxue,yingyu;
    int sum=0;
};
bool cmp(string a,string b){
    return a<b;
}
int main(){
    int n;
    cin>>n;
    Student student[1001];
    string pair[50000];
    for(int i=0;i<n;i++){
        cin>>student[i].name;
        cin>>student[i].yuwwen;
        cin>>student[i].shuxue;
        cin>>student[i].yingyu;
        student[i].sum+=student[i].yuwwen+student[i].shuxue+student[i].yingyu;
    }
    int k=0;
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            if(abs(student[i].yuwwen-student[j].yuwwen)<=5&&abs(student[i].shuxue-student[j].shuxue)<=5
            &&abs(student[i].yingyu-student[j].yingyu)<=5&&abs(student[i].sum-student[j].sum)<=10){
                if(student[i].name<student[j].name){
                    pair[k]=student[i].name+" "+student[j].name;
                }else{
                    pair[k]=student[j].name+" "+student[i].name;
                }
                k++;
            }
        }
    }
    sort(pair,pair+k, cmp);
    for(int i=0;i<k;i++){
        cout<<pair[i]<<endl;
    }

    return 0;
}