Codeforces Round 554 (Div.2)

A.奇数配偶数。

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 #include<algorithm>
 5 #define rep(i,l,r) for (int i=(l); i<=(r); i++)
 6 typedef long long ll;
 7 using namespace std;
 8 
 9 int n,m,x,s1,s2;
10 
11 int main(){
12     scanf("%d%d",&n,&m);
13     rep(i,1,n) scanf("%d",&x),s1+=x&1;
14     rep(i,1,m) scanf("%d",&x),s2+=x&1;
15     printf("%d\n",min(s1,m-s2)+min(s2,n-s1));
16     return 0;
17 }

A