Completed using priority queues, this problem should be a simulation implementation problem.
However, the priority queue should be faster. Remember not to update immediately, otherwise the rat that has finished fighting will be immediately taken to fight.
//====================================================================||
// ||
// ||
// Author : GCA ||
// 6AE7EE02212D47DAD26C32C0FE829006 ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <functional>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 100005
#define PII pair<int,int\>
#define PB push\_back
#define oo INT\_MAX
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int sg,sb,ba;
int main() {
ios\_base::sync\_with\_stdio(0);
int test;
scanf("%d",&test);
while(test--){
priority\_queue<int,vector<int\>,less<int\> > g,b;
scanf("%d%d%d",&ba,&sg,&sb);
for(int i=0;i<sg;i++){
int t;
scanf("%d",&t);
g.push(t);
}
for(int i=0;i<sb;i++){
int t;
scanf("%d",&t);
b.push(t);
}
int whowin=0;
vector<int\> tg,tb;
while(1){
if(g.empty()&&b.empty()){
break;
}else if(g.empty()){
whowin=2;
break;
}else if(b.empty()){
whowin=1;
break;
}
int t=min3(ba,g.size(),b.size());
for(int i=0;i<t;i++){
int x=g.top(),y=b.top();g.pop();b.pop();
// debug("%d %d\\n",x,y);
if(x>y)tg.PB(x-y);
else if(x<y)tb.PB(y-x);
}
for(int i=0;i<tg.size();i++)g.push(tg\[i\]);
for(int i=0;i<tb.size();i++)b.push(tb\[i\]);
tg.clear();tb.clear();
}
if(whowin==0)printf("green and blue died\\n");
else if(whowin==1){
printf("green wins\\n");
while(!g.empty()){
printf("%d\\n",g.top());
g.pop();
}
}
else{
printf("blue wins\\n");
while(!b.empty()){
printf("%d\\n",b.top());
b.pop();
}
}
if(test)Pln();
}
}