UVa12100 Printer Queue

#include<iostream>#include<cstdio>#include<string>#include<map>#include<sstream>#include<algorithm>#include<vector>#include<queue>#include<set>#include<cstring>#include<stack>#include<iomanip>#include<math.h>using namespace std;int main(){int T;while(scanf("%d",&T)!=EOF){while(T){int i,j,m,n;    scanf("%d %d",&n,&m);queue<int> q;priority_queue<int> pq;for(i=0;i<n;i++){int t;scanf("%d",&t);q.push(t);pq.push(t);}int index=0;while(1){if(q.front()==pq.top()){if(index==m){cout<<n-q.size()+1<<endl;break;}else{q.pop();pq.pop();index++;}}else{int t=q.front();q.pop();q.push(t);if(index==m){index=0;m=q.size()-1;}else{index++;}}}    T--;}}return 0;}