问如何根据第一个和第二个索引对C++中的2D向量进行排序？

EN

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

int main() {
    std::vector<std::vector<int>> vec = {{10, 25}, {10, 23}, {10, 22},
                                         {10, 24}, {1, 100}, {13, 12}};
    std::ranges::sort(vec);

    for (const auto& row : vec) 
        for (const auto& col : row) 
            std::cout << col << " ";            
}

1 100 10 22 10 23 10 24 10 25 13 12 

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

int main() {
    std::vector<std::vector<int>> vec = {{10, 25}, {10, 22}, {10, 26},
                                         {10, 24}, {1, 100}, {13, 12}};
    std::sort(vec.begin(), vec.end());

    for (const auto& row : vec)
        for (const auto& col : row) 
            std::cout << col << " ";
}

1 100 10 22 10 24 10 25 10 26 13 12

sort(vec.begin(), vec.end(), [&](vector<int> &a, vector<int> &b){
        return  a[0] < b[0]? true : (a[0] == b[0]) ?  a[1] < b[1] : false;
    });

int m = vec.size();
int n = vec[0].size();
sort(vec[0].begin(), vec[0].end());


for (int i = 0; i < m; i++) {
    for (int j = 0; j < n; j++)
        cout << vec[i][j] << " ";
    cout << endl;
}