#include <iostream>
#include <algorithm>
using namespace std;
const int N = 100010;
int n, m;
int a[N];
bool compare(int a, int b)
{
return a > b;
}
int main()
{
cin >> n >> m;
for (int i = 1; i <= n; i++) a[i] = i;
int flat, cot;
while (m--)
{
cin >> flat >> cot;
if (flat)
sort(a + cot, a + n+1);
else
sort(a+1,a+cot+1, compare);
}
for (int i = 1; i <= n; i++)
cout << a[i] << " ";
return 0;
}
注意:
sort (a,b) //a为起始地址,b为终止地址后一个地址
sort(a,b,c) //c为bool函数,表示排序规则