01背包

#include <bits/stdc++.h>
using namespace std;
int h , n , s[45005] , f[45005];
int main()
{
    cin >> h >> n;
    for (int i = 1 ; i <= n ; i++) cin >> s[i];
    for (int i = 1 ; i <= n ; i++)
    {
        for (int j = h ; j >= s[i] ; j--)
        {
            f[j] = max(f[j] , f[j - s[i]] + s[i]);
        }
    }
    cout << f[h];
    return 0;
}