Entrepreneur

/*
    Road to Freedom
*/

#include <bits/stdc++.h>

using namespace std;

#define ll             long long int
#define F              first
#define S              second
#define pb             push_back
#define si             set <int>
#define vi             vector <int>
#define pii            pair <int, int>
#define vpi            vector <pii>
#define vpp            vector <pair<int, pii>>
#define mii            map <int, int>
#define mpi            map <pii, int>
#define spi            set <pii>
#define endl           "\n"
#define sz(x)          ((int) x.size())
#define all(p)         p.begin(), p.end()
#define double         long double
#define que_max        priority_queue <int>
#define que_min        priority_queue <int, vi, greater<int>>
#define bug(...)       __f (#__VA_ARGS__, __VA_ARGS__)
#define print(a)       for(auto x : a) cout << x << " ";
#define print1(a)      for(auto x : a) cout << x.F << " " << x.S << endl
#define print2(a,x,y)  for(int i = x; i < y; i++) cout<< a[i]<< " "; cout << endl
#define REP(i,a,b)     for (int i = a; i <= b; i++)

inline int power(int a, int b)
{
    int x = 1;
    while (b)
    {
        if (b & 1) x *= a;
        a *= a;
        b >>= 1;
    }
    return x;
}

template <typename Arg1>
void __f (const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << endl; }
template <typename Arg1, typename... Args>
void __f (const char* names, Arg1&& arg1, Args&&... args)
{
    const char* comma = strchr (names + 1, ',');
    cout.write (names, comma - names) << " : " << arg1 << " | "; __f (comma + 1, args...);
}

bool check(ll hour, vector<int>& machine, ll car){
    ll prod = 0;
    for(auto& x:machine){
        prod += hour/x;
        if (prod >= car) return true;
    }
    if(prod >= car) return true;
    return false;
}

void solve(){
    ll n, t; cin >> n >> t; // machine and car
    vector<int> machine(n);
    for(int i = 0; i < n ;i++){
        cin >> machine[i];
    }

    //bin search
    ll left = 1;
    ll max_machine = *max_element(machine.begin(), machine.end());
    ll right = min(1LL * max_machine * t, (ll)1e18);
    while (left <= right) {
        ll mid = left + (right - left) / 2;
        if (check(mid, machine, t)) {
            right = mid - 1;
        } else {
            left = mid + 1;
        }
    }

    cout << left << endl;
}

int32_t main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    #ifndef ONLINE_JUDGE
        freopen("input.txt",  "r",  stdin);
        freopen("output.txt", "w", stdout);
    #endif

    clock_t z = clock();

    int t = 1;
    // cin >> t;
    while (t--) solve();

    cerr << "Run Time : " << ((double)(clock() - z) / CLOCKS_PER_SEC);

    return 0;
}

Test 1

Verdict: ACCEPTED

Run Time : 3.9e-05

Test 2

Verdict: ACCEPTED

Run Time : 4e-05

Test 3

Verdict: ACCEPTED

Run Time : 4e-05

Test 4

Verdict: ACCEPTED

Run Time : 3.9e-05

Test 5

Verdict: ACCEPTED

Run Time : 4e-05

Test 6

Verdict: ACCEPTED

Run Time : 0.000232

Test 7

Verdict: ACCEPTED

Run Time : 0.000247

Test 8

Verdict: ACCEPTED

Run Time : 0.046113

Test 9

Verdict: ACCEPTED

Run Time : 0.056086

Test 10

Verdict: ACCEPTED

Run Time : 0.121631

Test 11

Verdict: ACCEPTED

Run Time : 5e-05

Test 12

Verdict: ACCEPTED

Run Time : 4.7e-05

Test 13

Verdict: ACCEPTED

Run Time : 5.9e-05

Test 14

Verdict: ACCEPTED

Run Time : 5.8e-05

Test 15

Verdict: ACCEPTED

Run Time : 4.1e-05