Minimizing Coins

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

#define int long long
const int INF = 1000000000;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;
int dp[N];

signed main()
{
    int n , x;
    cin >> n >> x;
    int a[n];
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }
    dp[0] = 0;
    for(int i = 1; i <= x; i++){
        dp[i] = INF;
        for(int j = 0; j < n; j++){
            if(i >= a[j])
                dp[i] = min(dp[i] , dp[i - a[j]] + 1);
        }
    }
    cout << ((dp[x] == INF) ? -1 : dp[x]) << endl;
}