【二维数组与行列双重排序】GESP四级 / CSP-J 题解：luogu-B4580 [GESP202609 四级] 有序网格

3 2
6 5
4 3
2 1

1 2
3 4
5 6

/**
 * Problem: luogu-B4580
 * Standard: C++11 (CCF GESP 官方大纲规范)
 * Author: OneCoder
 */

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

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;
    if (!(cin >> n >> m)) {
        return 0;
    }

    int grid[15][15];
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> grid[i][j];
        }
    }

    // 1. 对每一行按升序排序
    for (int i = 0; i < n; ++i) {
        sort(grid[i], grid[i] + m);
    }

    // 2. 对每一列按升序排序
    for (int j = 0; j < m; ++j) {
        vector<int> col(n);
        for (int i = 0; i < n; ++i) {
            col[i] = grid[i][j];
        }
        sort(col.begin(), col.end());
        for (int i = 0; i < n; ++i) {
            grid[i][j] = col[i];
        }
    }

    // 3. 规整输出排序结果
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cout << grid[i][j] << (j + 1 == m ? "" : " ");
        }
        cout << "\n";
    }

    return 0;
}