Code Of The Day

SPOJ

Problem Code : ARMY

#include<stdio.h>
#include<iostream>
#include<algorithm>

using namespace std;

int main()
{
    int t,i,j,temp,ng,nm;
    scanf("%d",&t);

    while(t--)
    {
        scanf("%d %d",&ng,&nm);
        int ngArr[ng],nmArr[nm];

        for(i=1; i<=ng; i++)
        {
            scanf("%d",&ngArr[i]);
        }

        sort(ngArr+1,ngArr+ng);

        for(i=1; i<=nm; i++)
        {
            scanf("%d",&nmArr[i]);
        }
          

        sort(nmArr+1,nmArr+nm);

        i=1, j=1;

        while(1)
        {
             
            if(ngArr[i] >=nmArr[j])
            {
                j++;
                nm--;
            }
            else
            {
                i++;
                ng--;
            }
            if(ng==0)
                break;
            if(nm==0)
                break;
        }
        if(nm==0)
            printf("Godzilla\n");
        else if(ng==0)
            printf("MechaGodzilla\n");
        else
            printf("uncertain\n");
      }
      return 0;
}