三国游戏 贪心算法

# 三国游戏
n = int(input())
a= list(map(int,input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
def sjfs(country,a,b,c):
   if country ==0:
       s_list =[a[i]-b[i]-c[i]for i in range(0,len(a))]
   elif country ==1:
       s_list = [b[i]-a[i]-c[i]for i in range(0,len(a))]
   else:
       s_list =[c[i]-b[i]-a[i]for i in range(0,len(a))]

   s_list.sort(reverse= True)

   s = 0
   for i in range(0,n):
       x=s_list[i]
       s+=x
       if s<=0:
           break
   return i
d_list = [sjfs(x, a, b, c) for x in range(3)]
print(max(d_list))