周末舞会简易算法队列

解题思路:

注意事项:

参考代码:

#include <iostream>

#include <queue>

using namespace std;

int main(){

queue<int> s1;

queue<int> s2;

int m,n,s;

cin>>m>>n;

cin>>s;

for(int i=1;i<=m;i++){

s1.push(i);

}

for(int j=1;j<=n;j++){

s2.push(j);

}

for(int k=1;k<=s;k++){

int r1=s1.front();

s1.pop();

int r2=s2.front();

s2.pop();

cout<<r1<<" "<<r2<<endl;

s1.push(r1);

s2.push(r2);

}

return 0;

}