UVa 12049 - Just Prune The List Solution

#include<iostream>
#include<list>
#include<string>
#include<cstring>
#include<sstream>
#include<cctype>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<stack>
#include<fstream>
#include<cstdlib>
#include<vector>
#include<map>
#include<set>
#include<utility>
#include<iomanip>
#include<queue>

using namespace std;

#define INF (1<<29)
#define SET(a) memset(a,-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define CLR(a) memset(a,0,sizeof(a))
#define FILL(a,v) memset(a,v,sizeof(a))
#define PB push_back
#define FOR(i,n) for(int i = 0;i<n;i++)
#define PI acos(-1.0)
#define EPS 1e-9
#define MP(a,b) make_pair(a,b)
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
#define LL long long
#define MX 100000
#define MOD 1000000007

int main()
{
    int t,m,n,marr[10000+10],narr[10000+10];
    cin>>t;
    while(t--)
    {
        cin>>m>>n;

        for(int i=0;i<m;i++)
            cin>>marr[i];
        sort(marr,marr+m);

        for(int i=0;i<n;i++)
            cin>>narr[i];
        sort(narr,narr+n);

        int cnt1=0,cnt2=0;
        int same=0;

        while(cnt1<m && cnt2<n)
        {
            if(marr[cnt1]==narr[cnt2])
            {
                same++;
                cnt1++;
                cnt2++;
            }
            else if(marr[cnt1]>narr[cnt2])
                cnt2++;
            else
                cnt1++;
        }

        cout<<m+n-2*same<<endl;
    }
return 0;
}