C. Report

int n, m;
arr a, ans;
int top = 0;
int tot = 0;
struct node
{
    int r, tp, id;
} p[N], q[N];
bool cmp(node a, node b)
{
    if (a.r == b.r)
        return a.id > b.id;
    return a.r > b.r;
}

int main()
{
    // file("test");
    sdf(n), sdf(m);
    For(i, 1, n) sdf(a[i]);
    For(i, 1, m)
    {
        int x, y;
        sdf(x), sdf(y);
        p[i] = (node){y, x, i};
    }
    sort(p + 1, p + 1 + m, cmp);
    int st = 1;
    For(i, 1, m)
    {
        if (p[i].id < st)
            continue;
        st = p[i].id;
        if (i >= 2 && p[i].tp == q[tot].tp)
            continue;
        q[++tot] = p[i];
        if (p[i].id == m)
            break;
    }
    top = n+1;
    FFor(i, n, q[1].r + 1)
        ans[--top] = a[i];
    sort(a + 1, a + 1 + q[1].r);
    int L = 1, R = q[1].r;

    For(i, 1, tot)
    {
        int dt = q[i].r - q[i + 1].r;
        if (q[i].tp == 1)
        {
            FFor(j, R, R-dt+1)
                ans[--top] = a[j];
            R -= dt;
        }
        else
        {
            For(j, L, L + dt - 1)
                ans[--top] = a[j];
            L += dt;
        }
    }
    For(i,1,n)
        printf("%d ", ans[i]);

    return 0;
}