[codeforces] 493C

#include <iostream>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 200005
#define maxm 2000005
#define eps 1e-10
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
#define pii pair<int, int>
//#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
// head

int a[maxn];
int b[maxn];
int n, m;

void read(void)
{
	scanf("%d", &n);
	for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
	scanf("%d", &m);
	b[0] = 0;
	for(int i = 1; i <= m; i++) scanf("%d", &b[i]);
}

int cmp(int a, int b)
{
	return a < b;
}

void work(void)
{
	sort(a+1, a+n+1, cmp);
	sort(b+1, b+m+1, cmp);
	LL ans = -1e17, pos1, pos2;
	for(int i = 0; i <= m; i++) {
		int t1 = i * 2 + (m - i) * 3;
		int t = upper_bound(a+1, a+n+1, b[i]) - a - 1;
		int t2 = t * 2 + (n - t) * 3;
		if(t2 - t1 > ans) {
			ans = t2 - t1;
			pos2 = t1;
			pos1 = t2;
		}
	}
	printf("%I64d:%I64d\n", pos1, pos2);
}

int main(void)
{
	read();
	work();	

	return 0;
}