在C/C++中以递增的值对2D数组进行排序; 排序后知道原始位置？

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

using namespace std;

struct Element {
    int value;
    int row;
    int col;
};

bool compare(const Element &a, const Element &b) {
    return a.value < b.value;
}

int main() {
    int arr[3][3] = {
        {9, 4, 5},
        {7, 2, 1},
        {8, 3, 6}
    };

    vector<Element> elements;
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < 3; j++) {
            elements.push_back({arr[i][j], i, j});
        }
    }

    sort(elements.begin(), elements.end(), compare);

    for (const auto &e : elements) {
        cout << "Value: " << e.value << ", Original position: (" << e.row << ", " << e.col << ")"<< endl;
    }

    return 0;
}

Value: 1, Original position: (1, 2)
Value: 2, Original position: (1, 1)
Value: 3, Original position: (2, 2)
Value: 4, Original position: (0, 1)
Value: 5, Original position: (0, 2)
Value: 6, Original position: (2, 0)
Value: 7, Original position: (1, 0)
Value: 8, Original position: (2, 1)
Value: 9, Original position: (0, 0)