#include <bits/stdc++.h> using namespace std; typedef long long ll; int read() { int n; cin >> n; return n; } ll readl() { ll n; cin >> n; return n; } #define REP(i, n) for (int i=0, ___=(n); i<___; ++i) int main() { int n = read(); int m = read(); vector<pair<vector<int>, int> > v; vector<int> cur(n); REP(i, n) cur[i] = read(); v.push_back(make_pair(cur, 1)); REP(i, m-1) { int p = read() - 1; int x = read(); cur[p] = x; v.push_back(make_pair(cur, i+2)); } sort(v.begin(), v.end()); REP(i, m) cout << v[i].second << " "; return 0; }
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 <bits/stdc++.h> using namespace std; typedef long long ll; int read() { int n; cin >> n; return n; } ll readl() { ll n; cin >> n; return n; } #define REP(i, n) for (int i=0, ___=(n); i<___; ++i) int main() { int n = read(); int m = read(); vector<pair<vector<int>, int> > v; vector<int> cur(n); REP(i, n) cur[i] = read(); v.push_back(make_pair(cur, 1)); REP(i, m-1) { int p = read() - 1; int x = read(); cur[p] = x; v.push_back(make_pair(cur, i+2)); } sort(v.begin(), v.end()); REP(i, m) cout << v[i].second << " "; return 0; } |