#include<iostream> using namespace std; int v,n,value[31],weight[31],dp[31][20001]; int main(){ cin >> v >> n; for(int i = 1;i <= n;i++){ cin >> weight[i]; value[i] = weight[i]; } for(int i = 1;i <= n;i++){ for(int j = 1;j <= v;j++){ if(j >= weight[i]){ dp[i][j] = max(dp[i-1][j],dp[i-1][j-weight[i]]+value[i]); } else{ dp[i][j] = dp[i-1][j]; } } } cout << v-dp[n][v]; return 0; }