Problem: garlic Jun 1 shopping bag

Garlic king went shopping, he has a capacity of  $V$  shopping bag, and he bought a $n$  items, each item known volume v_ivi​. Garlic king wanted to know what the selection of articles into the shopping bag, the remaining space can be minimized bags.

Input Format

A first line of input integer  $V$ ($.\; 1\le V\le 20,000$ ), represents the capacity of the bag.

A second line of the input integer  $n$ ($.\; 1\le n\le .\; 30$ ), indicates garlic Jun purchased $n$  items.

Next input  $n$  lines, each line of input integer v_ivi​( 1 \ leq v_i \ leq 10,0001≤vi​≤ . 1 0 , 0 0 0 ), represents the $i$  volume of items.

Output Format

Output line, the output of an integer, represents the minimum space remaining bags.

Sample input

20
5
7
5
7
3
7

Sample Output

1

#include <stdio.h>
#include <stdlib.h>
int main()
{
int sum ,n ;
int i,j;
int v[35]={0},dp[35][20010];
memset(dp,0,sizeof(dp));


scanf("%d%d",&sum,&n);
for(i=1;i<=n;i++)
{
    scanf("%d",&v[i]);


}
for(i=1;i<=n;i++)
{
    for(j=1;j<=sum;j++)
    {
        if(j>v[i])
            dp[i][j]=dp[i-1][j]>(dp[i-1][j-v[i]]+v[i])?dp[i-1][j]:(dp[i-1][j-v[i]]+v[i]);
        else
            dp[i][j]=dp[i-1][j];
    }
}
printf("%d",sum-dp[n][sum]);


    return 0;
}