问在2dim的情况下排序和保留索引？

EN

#include <vector> // for std::vector
#include <algorithm> // for std::sort

// your matrix
int matrix[5][5] = { ... };

// we use a struct to store entries with coordiantes
struct Entry {
    int row, col;
    int value;
};

// copy matrix data to vector    
std::vector<Entry> entries;
for(int i=0; i<5; i++) {
    for(int j=i+1; j<5; j++) {
        entries.push_back({i,j,matrix[i][j]});
    }
}

// sort vector
std::sort(entries.begin(), entries.end(),
    [](const Entry& a, const Entry& b) {
        return a.value> b.value;
    });

node{    
int data;
int row;
int col;
node *next;
}