CCF CSP 学生排队 C++

学生排队

#include<bits/stdc++.h>
using namespace std;

/*int findwhere(vector<int> &a,int x){
	for(int i = 0; i < a.size();i++){
		if(a[i] == x){
			return i;
		}
	}
}*/

int main(){
	
	int n;
	cin>>n;
	int a[n];
	for(int i = 0; i < n; i++){
		a[i] = i+1;
		
	}
	int m;
	cin>>m;
	int where;
	while(m){
		int p,q;
		cin>>p>>q;
		/*int where = findwhere(a,p);
		cout<<where<<endl;*/
	
		for(int i = 0; i < n;i++){
		if(a[i] == p){
			 where  = i;
			 break;
		}
	}

	if(q < 0){
			for(int i = where;i>where+q;i--){
				a[i] = a[i-1];
			}
			a[where+q] = p;
		}
		else{
			for(int i = where;i<where+q;i++){
				a[i] = a[i+1];
			}
			a[where+q] = p;
		}
		m--;
	}
	for(int i = 0; i < n;i++){
		cout<<a[i]<<" ";
	}
}