ABC095B - Bitter Alchemy

問題：B - Bitter Alchemy

#include <algorithm>
#include <iostream>
using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)

int main(void) {
    const int INF = 1 << 30;
    int n, x, m, sum = 0, min_m = INF;

    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> x;
    REP(i, n) {
        cin >> m;
        sum += m;
        min_m = min(min_m, m);
    }
    
    cout << n + (x - sum) / min_m << "\n";
    return 0;
}