1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
   
    int n, m;
    cin >> n >> m;
    vector<int> oryg;
    for(int i = 0; i < n; i++){
        int a;
        cin >> a;
        oryg.push_back(a);
    }
    vector<pair<vector<int>, int> > prace;
    prace.push_back(make_pair(oryg, 1));
    for(int i = 0; i < m-1; i++){
        int a, b;
        cin >> a >> b;
        oryg[a-1] = b;
        prace.push_back(make_pair(oryg, i+2));
    }
    sort(prace.begin(), prace.end());
    for(auto p: prace){
        cout << p.second << " ";
    }
    cout << "\n";
    return 0;
}