Red and Green Apples

WA code:

#include<iostream>
#include<algorithm>
#define int long long
#define N 300001
using namespace std;
int A[N],B[N],C[N],ans=0;
bool cmp(int a,int b){
	return a>b;
}
main(){
	int x,y,a,b,c;
	cin>>x>>y>>a>>b>>c;
	for(int i=1;i<=a;i++) cin>>A[i];
	for(int i=1;i<=b;i++) cin>>B[i];
	for(int i=1;i<=c;i++) cin>>C[i];
	sort(A+1,A+a+1,cmp);
	sort(A+1,A+a+1,cmp);
	for(int i=1;i<=x;i++) C[i+c]=A[i];
	for(int i=1;i<=y;i++) C[i+c+x]=B[i];
	sort(C+1,C+y+c+x+1,cmp);
	for(int i=1;i<=x+y;i++) ans+=C[i];
	cout<<ans;
	return 0;
}