Problem: A programming competition site _AtCode_ provides algorithmic problems. Each problem is allocated a score based on its difficulty. Currently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points. These p_1 + … + p_D problems are all of the problems available on AtCode.  A user of AtCode has a value called _total score_. The total score of a user is the sum of the following two elements:    * Base score: the sum of the scores of all problems solved by the user.   * Perfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).  Takahashi, who is the new user of AtCode, has not solved any problem. His objective is to have a total score of G or more points. At least how many problems does he need to solve for this objective?

Submission attempts (in order):
d, g = map(int,input().split())
plist = [list(map(int,input().split())) for i in range(d)]

basiclist = []

problem = []

for i in range(len(plist)):
    tmplist = [plist[i][0], (plist[i][0])*(i+1)*100+plist[i][1]]
    problem.append(plist[i][0])
    basiclist.append(tmplist)

# print(basiclist)

import itertools

combs = []

for i in range(1, len(problem)+1):
    els = [list(x) for x in itertools.combinations(problem, i)]
    combs.extend(els)

# print(combs)

mincount = 2**10+1

for k in range (1, basiclist[-1][0]):
    if k*len(basiclist)*100 >= g:
        print(k)
        exit(0)

for comb in combs:
    remaininglist=[]
    for basic in basiclist:
        if basic[0] not in comb:
            remaininglist.append(basic[0])
    best_remaining_score = len(remaininglist)*100
    total_ps = 0
    for com in comb:
        tmp = 0
        for basic in basiclist:
            if com == basic[0]:
                if basic[1] > tmp:
                    tmp = basic[1]
        total_ps += tmp
    # print(total_ps)
    if len(remaininglist) == 0:
        mincount = min(mincount, sum(comb))
        continue
    for i in range(remaininglist[-1]):
        if total_ps + best_remaining_score*i >= g:
            mincount = min(mincount, i + sum(comb))
            break

print(mincount)


d, g = map(int,input().split())
plist = [list(map(int,input().split())) for i in range(d)]

# map of {number of problems to achieve ps : ps}
basiclist = []

for i in range(len(plist)):
    tmplist = [plist[i][0], (plist[i][0])*(i+1)*100+plist[i][1]]
    # problem.append(plist[i][0])
    basiclist.append(tmplist)

# combination of perfect score cases: ps0, ps1, ps2, ps0 + ps1, ...
import itertools

problem = [i for i in range(d)]

combs = []

for i in range(1, d+1):
    els = [list(x) for x in itertools.combinations(problem, i)]
    # print(els)
    combs.extend(els)


mincount = 2**10+1

# case without perfect score
for i in range (d):
    for j in range (1, basiclist[i][0]):
        if j*(i+1)*100 >= g:
            mincount = min(mincount, j)

# case of with perfect score
for comb in combs:
    # find the best-valued question that is not in the combination
    best_remaining_num = -1
    for a in range(d):
        if a not in comb:
            best_remaining_num = max(a, best_remaining_num)
    best_remaining_score = (best_remaining_num+1)*100

    # total perfect score of the combination and attempts required to achieve the score
    total_ps = 0
    total_ps_count = 0
    for com in comb:
        total_ps += basiclist[com][1]
        total_ps_count += basiclist[com][0]

    if best_remaining_num == -1:
        mincount = min(mincount, total_ps_count)
        continue


    for i in range(basiclist[best_remaining_num][0]):
        if total_ps + best_remaining_score*i >= g:
            
            mincount = min(mincount, i + total_ps_count)
            # print(mincount)
            break

print(mincount)


Verdicts: Wrong Answer

Accepted