第二个点WA掉了

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