23 lines
554 B
C++
23 lines
554 B
C++
// lanqiao 1458 双向排序(sort模拟)
|
|
#include<bits/stdc++.h>
|
|
using namespace std;
|
|
bool cmp(int a, int b){ return a > b; }
|
|
int main(){
|
|
int n, m; cin >> n >> m;
|
|
vector<int> v;
|
|
for(int i = 1; i <= n; i++) v.push_back(i);
|
|
for(int i = 1; i <= m; i++){
|
|
int p, q; cin >> p >> q;
|
|
// sort函数排序范围遵循左闭右开
|
|
if(!p) sort(v.begin(), v.begin() + q, cmp);
|
|
else sort(v.begin() + q - 1, v.end());
|
|
}
|
|
for(auto res:v) cout << res << ' ';
|
|
return 0;
|
|
}
|
|
/* test samples 3 1 2
|
|
3 3
|
|
0 3
|
|
1 2
|
|
0 2
|
|
*/ |