2020年第十一届蓝桥杯软件类省赛python组压轴题--装饰珠

num=[]

skill=[]

max_value_li=[]

max_value=0

for i in range(6):

l=list(map(int,input().split()))

l.pop(0)

num.extend(l)

num.sort(reverse=True)

n=int(input())

for j in range(n):

skill.append(list(map(int,input().split())))

x=n

y=n

while y!=0:

x=y

value = [0] * n

max_value_li = []

for i in num:

if x<=i:

value[x-1]+=1

else:

x-=1

value[x-1] += 1

for x,h in enumerate(value):

if h>len(skill[x]) -2:

max_value_li.append(skill[x][-1])

break

if h==0:

continue

max_value_li.append(skill[x][1+h])

max_value=max(sum(max_value_li),max_value)

y-=1

print(max_value)