TOI11: Labor At The Dock

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

#define lli long long

vector<int> carry;
int nw;
lli ni;

bool CanCarry(lli t){
    lli r = ni;
    for(int i = 0; i < nw; ++i){
        r -= (t / carry[i]);
        if(r <= 0){
            return true;
        }
    }
    return false;
}

int main(){

    int x;

    scanf("%d %lld", &nw, &ni);
    carry.assign(nw, 0);
    for(int i = 0; i < nw; ++i){
        scanf("%d", &x);
        carry[i] = x;
    }
    sort(carry.begin(), carry.end());

    lli l = carry[0];
    lli r = carry[0] * ni;
    lli ans = carry[0] * ni;
    while(l <= r){
        lli m = (l + r) / 2;
        if(CanCarry(m)){
            ans = min(ans, m);
            r = m - 1;
        } else {
            l = m + 1;
        }
    }
    cout << ans;

    return 0;
}