-
Notifications
You must be signed in to change notification settings - Fork 44
/
CC_EvenEqualOdd.cpp
79 lines (73 loc) · 1.44 KB
/
CC_EvenEqualOdd.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(),c.end()
#define mp(x,y) make_pair(x,y)
#define mem(a,val) memset(a,val,sizeof(a))
#define eb emplace_back
#define f first
#define s second
using namespace std;
int main()
{
std::ios::sync_with_stdio(false);
int T;
cin>>T;
// cin.ignore(); must be there when using getline(cin, s)
while(T--)
{
int n;
cin>>n;
vector<int> even,odd;
for(int i=0;i<2*n;i++){
int a;
cin>>a;
if(a%2==0){
even.push_back(a);
}
else{
odd.push_back(a);
}
}
if(odd.size()>even.size()){
cout<<(odd.size()-even.size())/2<<endl;
}
else{
int cnt=0;
int es=even.size(),os=odd.size();
for(int i=0;i<even.size()&&(es!=os);i++){
if((even[i]/2)%2!=0){
es--;
even.erase(even.begin()+i);
os++;
cnt++;
}
}
if(es!=os){
int diff=abs(es-os)/2;
sort(even.begin(),even.end());
for(int i=0;i<even.size()&&diff--;i++){
while(even[i]%2==0){
even[i]/=2;
cnt++;
}
}
}
cout<<cnt<<endl;
}
}
return 0;
}