[蓝桥杯 2021 省 B] 双向排序

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 100010;

int n, m;
int a[N];

int main()
{
    scanf("%d%d", &n, &m);
    
    for (int i = 1; i <= n; i ++ ) a[i] = i;
    
    while (m -- )
    {
        int p, q;
        cin >> p >> q;
        
        if (p == 0) sort(a + 1, a + q + 1, greater<int>());
        else sort(a + q, a + n + 1);
    }
    
    for (int i = 1; i <= n; i ++ ) printf("%d ", a[i]);

    return 0;
}