프로그래머스 - 이모티콘 할인행사 (L2)

 1result = []
 2
 3def dfs(size, percent, users, emoticons):
 4    global result
 5
 6    if len(percent) == size:
 7        temp = [0] * len(users)
 8        for i in range(size):
 9            for j in range(len(users)):
10                if percent[i]*100 >= users[j][0]:
11                    temp[j] += emoticons[i]*(1-percent[i])
12        serviceNum = 0
13        income = 0
14        for i in range(len(users)):
15            if temp[i] >= users[i][1]:
16                serviceNum += 1
17            else:
18                income += temp[i]
19        result.append ((serviceNum, income))
20        return
21
22    for i in [0.1, 0.2, 0.3, 0.4]:
23        dfs(size, percent+[i], users, emoticons)
24
25
26def solution(users, emoticons):
27    dfs(len(emoticons), [], users, emoticons)
28    result.sort(reverse=True)
29    return list(result[0])