为啥没说明数据规模 下面附80分代码

#include <bits/stdc++.h>
using namespace std;
struct EDGE {int n,y,z;}e[1090009];
bool cmp(EDGE p,EDGE q){
    return p.z>q.z;
}
int main()
{
    int np,a,b,c;
    scanf("%d",&np);

    for(int i=1;i<=np;++i){
        scanf("%d%d%d",&a,&b,&c);
        e[i].n=i;e[i].y=a;e[i].z=(a+b+c);
    }
    sort(e+1,e+1+np,cmp);
    int cnt=0;
    for(int i=1;i<=5;i++){
        if(e[i].z!=e[i+1].z){
            cout<<e[i].n<<" "<<e[i].z<<endl;
        }
        else if(e[i].y!=e[i+1].y){
            if(e[i].y<e[i+1].y){
                swap (e[i],e[i+1]);
            }
            cout<<e[i].n<<" "<<e[i].z<<endl;
        }
        else{
            if(e[i].n>e[i+1].n){
                swap (e[i],e[i+1]);
            }
            cout<<e[i].n<<" "<<e[i].z<<endl;
        }
    }

    return 0;
}

求大佬帮调