Codeforces Round #344 (Div. 2) C. Report （脑洞题）

C. Report

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Each month Blake gets the report containing main economic indicators of the company "Blake Technologies". There are ncommodities produced by the company. For each of them there is exactly one integer in the final report, that denotes corresponding revenue. Before the report gets to Blake, it passes through the hands of m managers. Each of them may reorder the elements in some order. Namely, the i-th manager either sorts first ri numbers in non-descending or non-ascending order and then passes the report to the manager i + 1, or directly to Blake (if this manager has number i = m).

Employees of the "Blake Technologies" are preparing the report right now. You know the initial sequence ai of length n and the description of each manager, that is value ri and his favourite order. You are asked to speed up the process and determine how the final report will look like.

Input

The first line of the input contains two integers n and m (1 ≤ n, m ≤ 200 000) — the number of commodities in the report and the number of managers, respectively.

The second line contains n integers ai (|ai| ≤ 109) — the initial report before it gets to the first manager.

Then follow m lines with the descriptions of the operations managers are going to perform. The i-th of these lines contains two integersti and ri (, 1 ≤ ri ≤ n), meaning that the i-th manager sorts the first ri numbers either in the non-descending (if ti = 1) or non-ascending (if ti = 2) order.

Output

Print n integers — the final report, which will be passed to Blake by manager number m.

Examples

input

3 1
1 2 3
2 2

output

2 1 3 

input

4 2
1 2 4 3
2 3
1 2

output

2 4 1 3 

Note

In the first sample, the initial report looked like: 1 2 3. After the first manager the first two numbers were transposed: 2 1 3. The report got to Blake in this form.

In the second sample the original report was like this: 1 2 4 3. After the first manager the report changed to: 4 2 1 3. After the second manager the report changed to: 2 4 1 3. This report was handed over to Blake.

题意：给你n个数，然后m个操作，如果op=1,要求让前x个数按照非递减排序。如果op=2，y要求让前x个数按照非递增排序。

题解：去除一些后续的无效操作。把有效操作记录下来。不必要把每个数都排序一遍。因为有些数的位置是不变的。

最后倒序遍历一遍就可以了。（这题想不出来可以套线段树的。。。）

代码：

#pragma comment(linker, "/STACK:102400000,102400000")
//#include<bits/stdc++.h>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<map>
#include<cmath>
#include<queue>
#include<set>
#include<stack>
#include <utility> 
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define mst(a) memset(a, 0, sizeof(a))
#define M_P(x,y) make_pair(x,y)
#define in freopen("in.txt","r",stdin) 
#define rep(i,j,k) for (int i = j; i <= k; i++)  
#define per(i,j,k) for (int i = j; i >= k; i--)  
#define lson  l , mid , rt << 1  
#define rson  mid + 1 , r , rt << 1 | 1  
const int lowbit(int x) { return x&-x; }  
const double eps = 1e-8;  
const int INF = 1e9+7; 
const ll inf =(1LL<<62) ;
const int MOD = 1e9+7;  
const ll mod = (1LL<<32);
const int N =2e5+7; 
const int M=100010;
const ll MAX=1e18;
//const int maxn=1001; 
template <class T1, class T2>inline void getmax(T1 &a, T2 b) {if (b>a)a = b;}  
template <class T1, class T2>inline void getmin(T1 &a, T2 b) {if (b<a)a = b;}
int read(){
int v = 0, f = 1;char c =getchar();
while( c < 48 || 57 < c ){if(c=='-') f = -1;c = getchar();}
while(48 <= c && c <= 57) v = v*10+c-48, c = getchar();
return v*f;}
int a[N],r[N],t[N],b[N];
int main()
{
	ios::sync_with_stdio(false);
	int n,m;
	int op,x; int cnt=0;
	cin>>n>>m;
	for(int i=0;i<n;i++)cin>>a[i],b[i]=a[i];
	for(int i=0;i<m;i++){
		cin>>op>>x;
		while(cnt > 0 && x > r[cnt-1]) --cnt;
		t[cnt] = op, r[cnt] = x ;
		cnt++;	
	}
	//cout<<"cnt="<<cnt<<endl;
	//for(int i=0;i<m;i++) cout<<r[i]<<endl;
	r[cnt] = 0;
	sort(b,b+r[0]);
	int b_right=r[0]-1;
	int b_left=0;
	for(int i=1;i<=cnt;i++)
	{
		 for(int j=r[i-1] -1; j>=r[i];--j)
		 {
		 	if(t[i-1] == 1) a[j]= b[b_right--]; //递增 
		 	else a[j]=b[b_left++]; //递减 
		 }
	}
	for(int i=0;i<n;i++)cout<<a[i]<<" "; 
	return 0;
}