Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- using lli = long long ;
- const lli INF = 2e18;
- const lli N = 2e12;
- const lli M = 1e6 + 10;
- lli tim[M];
- lli n, m;
- lli product(lli t){
- lli cnt = 0;
- for(int i=1;i<=m;i++){
- if(tim[i] > t) break;
- cnt += (lli) t/ tim[i];
- }
- return cnt;
- }
- int main(){
- scanf("%lld%lld", &m, &n);
- for(int i=1;i<=m;i++)
- scanf("%lld", &tim[i]);
- sort(tim + 1, tim + m + 1);
- lli l = 1, r = N, mn = INF;
- while(l<=r){
- lli mid = (l + r)/ 2;
- if(product(mid) >= n)
- mn = min(mn, mid), r = mid - 1;
- else
- l = mid + 1;
- }
- printf("%lld", mn);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement