프로그래머스 - 광물 캐기 (L2)

 1def solution(picks, minerals):
 2    bundles = []
 3    tmp = [0, 0, 0]
 4    DATA = [[1, 1, 1], [5, 1, 1], [25, 5, 1]]
 5    answer = 0
 6
 7    for i in range(len(minerals)):
 8        if minerals[i] == "diamond":
 9            for j in range(3):
10                tmp[j] += DATA[j][0]
11        elif minerals[i] == "iron":
12            for j in range(3):
13                tmp[j] += DATA[j][1]
14        elif minerals[i] == "stone":
15            for j in range(3):
16                tmp[j] += DATA[j][2]
17
18        if (i+1) % 5 == 0 or i == len(minerals)-1:
19            bundles.append(tmp)
20            tmp = [0, 0, 0]
21    bundles = bundles[:sum(picks)]
22    bundles.sort(key= lambda x: -x[2])
23
24    for i in bundles:
25        for j in range(3):
26            if picks[j] != 0:
27                answer += i[j]
28                picks[j] -= 1
29                break
30
31    return answer