The two countries of A and B are at war against each other. Both countries have N number of soldiers. The power of these soldiers are given by A[i]...A[N] and B[i]....B[N].
These soldiers have a pecularity. They can only attack their counterpart enemies, like A[i] can attack only B[i] and not anyone else. A soldier with higher power can kill the enemy soldier. If both soldiers have same power, they both die. You need to find the count of remaining soldiers of A and B at the end of the war. Also, print the winner country.
The first line of the input contains a single integer T, denoting the number of test cases. Then T test case follows. Each testcase contains three lines of input:-
The number of soldiers N.
Powers of A country's soldiers Ai ... AN separated by spaces
Powers of B country's soldiers Bi ... BN separated by spaces
For each testcase, print the remaining soldiers of both A and B, and the winner country. If the remaining soldiers are equal for both countries, the war ends up draw.
See examples for more clarity.
1 <= T <= 100
1 <= N <= 2000
0 <= Ai <= 1000
1 2 3 4 5 6
6 5 4 3 2 1
3 3 DRAW
1 0 A
0 2 B
Testcase3: Both countries have 2 soldiers. B kills A, B kills A. A has 0 soldiers alive at the end. B has both soldiers alive at the end. We print the results and B as winner.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.