C++ :

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

int main()
{
	int n, m, k, a[101], b[101];
	while(scanf("%d",&n) != EOF)
	{
		for(int i = 0 ; i < n ; i ++)
		{
			scanf("%d",&a[i]);
		}
		scanf("%d",&m);
		for(int i = 0 ; i < m ; i ++)
		{
			scanf("%d",&b[i]);
		}

		sort(a,a+n);
		int ans = 0, ans1 = 0;

		for(int i = n - 1 ; i >= 0 ; i --)
		{
			if(i != n - 1 && a[i] == a[i+1])
				continue;
			ans += a[i];
		}

		sort(b,b+m);

		for(int i = 0 ; i < m ; i ++)
			if(b[i] <= ans)
				ans1++;

		cout << ans1 << endl;
	}
	return 0;
}