2 solutions

  • 0
    @ 2026-2-25 11:05:41

    #include<bits/stdc++.h> using namespace std; struct s{ string name; int yu,shu,yin,zong; }; bool cmp(s a,s b) { if(a.name<b.name) return 1; return 0; } s g[9876]; int main() { int n; cin>>n; for(int i=0;i<n;i++){ cin>>g[i].name>>g[i].yu>>g[i].shu>>g[i].yin; g[i].zong=g[i].yu+g[i].shu+g[i].yin; } sort(g,g+n,cmp); for(int i=0;i<n;i++){ for(int j=i+1;j<n;j++){ if(g[i].shu-g[j].shu>=-5&&g[i].shu-g[j].shu<=5){ if(g[i].yu-g[j].yu>=-5&&g[i].yu-g[j].yu<=5){ if(g[i].yin-g[j].yin>=-5&&g[i].yin-g[j].yin<=5){ if(g[i].zong-g[j].zong>=-10&&g[i].zong-g[j].zong<=10){ cout<<g[i].name<<" "<<g[j].name<<endl; } } } } } } return 0; }

    Information

    ID
    1615
    Time
    1000ms
    Memory
    256MiB
    Difficulty
    1
    Tags
    (None)
    # Submissions
    7
    Accepted
    4
    Uploaded By