1295：装箱问题

#include<bits/stdc++.h>
using namespace std;
#define M 100000
int f[M], c[M];
int v, m;
int main() {
	cin>>v>>m;
	for(int i = 1; i <= m; i++)cin>>c[i];
	for(int i = 1; i <= m; i++)
		for(int j = v; j >= c[i]; j--)
			f[j] = max(f[j], f[j-c[i]]+c[i]);
	cout<<v - f[v]<<endl;
	return 0;
}