用插入排序怎么做

这程序0分

using namespace std;
int a[310],b[310],c[310],num[310],total[310],n;
void zzswap(int a,int b){
    int t;
    t=a;
    a=b;
    b=t;
}
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i]>>b[i]>>c[i];
        num[i]=i;
        total[i]=a[i]+b[i]+c[i];
    }
    for(int i=1;i<=n;i++){
        int minn=0;
        for(int j=i+1;j<=n;j++){
            minn=max(minn,total[j]);
        }
        for(int j=i+1;j<=n;j++){
            if(total[j]==minn){
                cout<<i<<j<<endl; 
                zzswap(total[i],total[j]);
                zzswap(num[i],num[j]);
                cout<<total[i]<<total[j]<<endl; 
            }
        }
    }
    for(int i=1;i<=5;i++){
        cout<<num[i]<<" "<<total[i]<<endl;
    }
    return 0;
}```