题解 | Problem B

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int m;
    while (cin >> m) {
        vector<vector<int>> vec1(m, vector<int>(m));
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < m; j++) cin >> vec1[i][j];
        }
        vector<int> vec2;
        int sum1 = 0, sum2 = 0;
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < m; j++) {
                sum1 += vec1[i][j];
                sum2 += vec1[j][i];
            }
            vec2.push_back(sum1);
            vec2.push_back(sum2);
            sum1 = 0;
            sum2 = 0;
        }
        for (int i = 0; i < m; i++) {
            sum1 += vec1[i][i];
            sum2 += vec1[i][m - i - 1];
        }
        vec2.push_back(sum1);
        vec2.push_back(sum2);
        sort(vec2.begin(), vec2.end());
        for (int i = 2 * m + 1; i >= 0; i--) cout << vec2[i] << " ";
        cout << "\n";
    }
    return 0;
}