T2744.X02神秘大礼包
2023-08-17 10:47:24
发布于：浙江
64阅读
0回复
0点赞
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double PI = acos(-1);
const ll N=1e5+5;
int n,m,T;
struct node{
string x,y;
};
queue<node> q;
int main(){
freopen("GiftPack.in","r",stdin);
freopen("GiftPack.out","w",stdout);
cin>>n>>m;
for(int i=1;i<=n;i++){
node x;
cin>>x.x>>x.y;
q.push(x);
}
while(m--){
ll x;
cin>>x;
x--;
x%=n;
while(x--){
q.push(q.front());
q.pop();
}
cout<<q.front().x<<" "<<q.front().y<<endl;
q.pop();
n--;
}
fclose(stdin);
fclose(stdout);
return 0;
}
有帮助，赞一个