ruozhi

#include<bits/stdc++.h>
using namespace std;
int v,n;
int c[31];
int dp[31][20005];
int main(){
cin >> v >> n;
for(int i = 1;i <= n;i ++){
cin >> c[i];
}
for(int i = 1;i <= n;i ++){
for(int j = 1;j <= v;j ++){
dp[i][j] = dp[i-1][j];
if(j >= c[i]) dp[i][j] = max(dp[i-1][j] , dp[i-1][j-c[i]] +c[i]);
}
}
cout << v - dp[n][v];
return 0;
}