#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 5; int n, m; vector<pair<vector<int>, int>> v; vector<int> elo; int main() { scanf("%d%d", &n, &m); for (int i = 1; i <= n; i++) { int t; scanf("%d", &t); elo.push_back(t); } v.push_back({elo, 1}); for (int i = 2; i <= m; i++) { int p, x; scanf("%d%d", &p, &x); elo[p-1] = x; v.push_back({elo, i}); } sort(v.begin(), v.end()); for (int i = 0; i < m; i++) printf("%d ", v[i].second); printf("\n"); 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 | #include <bits/stdc++.h> using namespace std; const int N = 5e5 + 5; int n, m; vector<pair<vector<int>, int>> v; vector<int> elo; int main() { scanf("%d%d", &n, &m); for (int i = 1; i <= n; i++) { int t; scanf("%d", &t); elo.push_back(t); } v.push_back({elo, 1}); for (int i = 2; i <= m; i++) { int p, x; scanf("%d%d", &p, &x); elo[p-1] = x; v.push_back({elo, i}); } sort(v.begin(), v.end()); for (int i = 0; i < m; i++) printf("%d ", v[i].second); printf("\n"); return 0; } |