Entrepreneur

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

int n, t;
int k[200000];

int isEnoughTime(long long x){
	long long sum = 0;
	for(int i = 0; i < n; i++){
		sum += (x / k[i]);
		if(sum >= t) return 1;
	}
	return 0;
}

int main(){
	cin >> n >> t;
	int min = INT_MAX;
	for(int i = 0; i < n;  ++i){
		cin >> k[i];
		if(k[i] < min) min = k[i];
	}
	
	long long l = 0, r = min * t;
	long long mid;
	while(l < r){
		//cout<<l<<" "<<r<<endl;
		mid = (l + r) / 2;
		if(mid == l) break;
		//cout<<isEnoughTime(mid)<<endl;
		if(isEnoughTime(mid)){
			r = mid;
		}
		else{
			l = mid;
		}
	}
	if(isEnoughTime(l)) cout<<l<<endl;
	else cout<<r<<endl;
	
	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: ACCEPTED