题解

#include<bits/stdc++.h>
using namespace std;

const int N = 40, M = 2e4 + 10;
int v[N];
int dp[M];  

int main() {
	
	int V, n; 
	cin >> V >> n;
	for(int i = 1; i <= n; i++) {
		cin >> v[i];
	} 
	for(int i = 1; i <= n; i++) {
		for(int j = V; j >= v[i]; j--) {
			dp[j] = max(dp[j], dp[j-v[i]] + v[i]);
		}
	}
	cout << V - dp[V];

	return 0;
}