forked from kothariji/competitive-programming
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path(CODECHEF)FAIRELCT.cpp
46 lines (45 loc) · 919 Bytes
/
(CODECHEF)FAIRELCT.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
#include<bits/stdc++.h>
#define ll long long int
#define speed ios_base::sync_with_stdio(false) , cin.tie(0) , cout.tie(NULL)
using namespace std;
int main()
{
speed;
ll t;
cin>>t;
while(t--)
{
ll n,m;
cin>>n>>m;
ll john[n],jack[m],jo=0,jk=0,swp=0;
for(ll i=0;i<n;i++)
{
cin>>john[i];
jo+=john[i];
}
for(ll i=0;i<m;i++)
{
cin>>jack[i];
jk+=jack[i];
}
sort(john,john+n);
sort(jack,jack+m,greater<ll>());
bool f=0;
for(ll i=0;i<n;i++)
{
if(jo > jk)
{
f=1;
break;
}
jo+=jack[i]-john[i];
jk+=john[i]-jack[i];
swp++;
}
if(f==1 || jo>jk)
cout<<swp<<"\n";
else
cout<<"-1\n";
}
return 0;
}