Entrepreneur

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define die(x) return cout << x << endl, 0
#define all(o) o.begin(), o.end()
#define endl '\n'
#define IOS ios::sync_with_stdio(0), cin.tie(0)
#define FILE freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define SZ(x) ((int)(x).size())
typedef long double ld;
typedef long long ll;
int gcd(int x,int y){ return (!y ? x : gcd(y, x%y)); }
int to_int(string sconvert){stringstream geek(sconvert);int xconvert = 0; geek >> xconvert; return xconvert;}
const int MAXN=200000+30,MAX_LOG=40,INF=1e18 + 10,MOD=1e9+7;
const double PI = acos(-1);
int mod(int x) { return (x % MOD + MOD) % MOD; }
int power(int x,int y){
    if(y==0)return 1;
    int c=power(x,y/2);
    c=(c*c)%MOD;
    if(y%2)c=(c*x)%MOD;
    return c;
}

bool checkIthBit(int number, int i) {
    return (number >> i) & 1; 
}

int n, t;
int a[MAXN];
int MAIN(){
    cin>>n>>t;
    for (int i = 0; i < n; i++){
        cin>>a[i];
    }
    int high = INF;
    int low = 0;
    for (int i = 0; i < 100; i++){
        int mid = (high + low) / 2LL;
        // cout << "pp---low: "<<low<<" high: "<<high<<"mid: "<<mid<<endl;
        int total_cars = 0;
        for (int j = 0; j < n; j++){
            total_cars += (mid / a[j]);
        }
        // cout<<total_cars<<endl;
        if(total_cars< t)low = mid;
        else high=mid;
        // cout << "low: "<<low<<" high: "<<high<<"mid: "<<mid<<endl;
    }
    int total_cars = 0;
    for (int j = 0; j < n; j++){
        total_cars += (low / a[j]);
    }
    if(total_cars>=t)high=low;
    cout<<high;
    
    return 0;
}
int32_t main(){
    IOS;
    int t=1;
    // cin>>t;
    while(t--)MAIN();
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED