import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
int a[] = new int[n+1];
for(int i = 1; i <= n; i++) {
a[i] = sc.nextInt();
}
int[][] dp = new int[n+1][k+1];
for(int i = 0; i <= k; i++){
dp[0][i] = 10001;
}
for (int i = 1; i <= n; i++) {
for(int j = 0; j <= k; j++){
if(a[i]>=j)
dp[i][j] = min(dp[i-1][j],a[i]);
else dp[i][j] = min(dp[i-1][j-a[i]]+a[i],dp[i-1][j]);
}
}
System.out.print(dp[n][k]);
}
public static int min(int a,int b){
return a>b?b:a;
}
}
外卖满减
最新推荐文章于 2021-02-16 03:58:31 发布