1152A - Neko Finds Grapes

#include <iostream>

#include<vector>

#include<string>

#include<math.h>

#include<set>

#include<map>

#include<stack>

#include<queue>

#include<algorithm>

/* ==================================================

  |                                                  |

  |    Author: *** S. M. Sabiul Hajjaj Sabit ***     |

  |       Last Edit:  May,14,2019                    |

   ================================================== */

///***global declaration***///

#define all(arr) arr.begin(),arr.end()

#define pb push_back

#define sz(x) x.size()

#define min3(a,b,c)  min(min(a,b),c)

#define max3(a,b,c)  max(max(a,b),c)

using namespace std;

int i,n,m,sum=0,ans=0;

template <typename T>long long int power(T a, T b)

{

    long long int pow=1;

    for(int i=0; i<b; i++)

    {

        pow *= a;

    }

    return pow;

}

///*********Write Code From Here*********///

int main()

{

    int neven=0,nodd=0,meven=0,modd=0;

    cin>>n>>m;

    for(i=0; i<n; i++)

    {

        int t;

        cin>>t;

        if(t%2==0)neven++;

        else nodd++;

    }

    for(i=0; i<m; i++)

    {

        int t;

        cin>>t;

        if(t%2==0)meven++;

        else modd++;

    }

    cout<<min(modd,neven)+min(meven,nodd)<<endl;

}