Submission #2581895

---

Source Code Expand

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    n,k = LI()
    a = LI()
    if sum(a) < k:
        return -1
    dp = [inf] * (k+1)
    dp[0] = 0
    for c in a:
        for i in range(k-1,-1,-1):
            t = i + c
            if t > k:
                t = k
            if dp[t] > dp[i] + 1:
                dp[t] = dp[i] + 1

    return dp[k]




print(main())

Submission Info

Judge Result