题解 | Problem B

#include <bits/stdc++.h>
#include <vector>
using namespace std;

int main(){
    int n;
    while(cin>>n){
        int a[n][n];
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                cin>>a[i][j];
            }
        }
        vector<int>b;
        for(int i=0;i<n;i++){
            int x=0;
            for(int j=0;j<n;j++){
                x+=a[i][j];
            }
            b.push_back(x);
        }
        for(int i=0;i<n;i++){
            int x=0;
            for(int j=0;j<n;j++){
                x+=a[j][i];
            }
            b.push_back(x);
        }
        int x=0,y=0;
        for(int i=0;i<n;i++){
            x+=a[i][i];
            y+=a[i][n-1-i];
        }
        b.push_back(x);
        b.push_back(y);
        sort(b.begin(),b.end());
        for(int i=b.size()-1;i>=0;i--)cout<<b[i]<<" ";
        cout<<endl;
    }
}

很单纯，直接存起来算