原题传送门
如果我先做了一个
的操作,又做了一个
的操作,那么一开始的那个操作就没用了
可以记录每个点最晚的操作,从后往前逐位确定即可
Code:
#include <bits/stdc++.h>
#define maxn 200010
using namespace std;
int n, m, a[maxn], pos[maxn], type[maxn], Max, ans[maxn];
inline int read(){
int s = 0, w = 1;
char c = getchar();
for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
return s * w;
}
int main(){
n = read(), m = read();
for (int i = 1; i <= n; ++i) a[i] = read();
for (int i = 1; i <= m; ++i){
int t = read(), r = read();
pos[r] = i, type[r] = t;
Max = max(Max, r);
}
sort(a + 1, a + 1 + Max);
for (int i = n; i > Max; --i) ans[i] = a[i];
int h = 1, t = Max, now = 0, opt = 0;
for (int i = Max; i; --i){
if (pos[i] > now) now = pos[i], opt = type[i];
ans[i] = opt == 1 ? a[t--] : a[h++];
}
for (int i = 1; i <= n; ++i) printf("%d ", ans[i]);
return 0;
}