Luogu P1049 装箱问题 [NOIP 2001 普及组]

#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>

using namespace std;

int f[20005];

int main () {
	int v,n;
	scanf ("%d%d",&v,&n);
	memset (f,-1,sizeof (f));
	f[0]=0;
	for (int i=1;i<=n;i++) {
		int q;
		scanf ("%d",&q);
		for (int j=v;j>=q;j--) {
			if (f[j-q]==-1) continue;
			f[j]=j;
		}
	}
	for (int i=0;i<v;i++) f[v]=max (f[v],f[i]);
	printf ("%d",v-f[v]);
	return 0;
}