[15810] 풍선 공장

https://www.acmicpc.net/problem/15810

15810번: 풍선 공장

우선순위큐로도 풀릴것만 같은 문제다.

---

#include <bits/stdc++.h>

using namespace std;

#ifdef ONLINE_JUDGE

constexpr bool local = false;

#else

constexpr bool local = true;

#endif

using ll = long long;

using pi = pair<ll, ll>;

ll n, m, ans;

vector<ll> v;

bool f(ll mid) {

    ll i, cur = 0;

    for (i = 0; i < n; i++) cur += (mid / v[i]);

    return cur >= m;

}

int main(void) {

    if (!local) ios_base::sync_with_stdio(0), cin.tie(0);

    cin >> n >> m;

    v.resize(n);

    ll i;

    for (i = 0; i < n; i++) cin >> v[i];

    ll s = 1, e = 1'000'000'000'000;

    ans = e;

    while (s <= e) {

        ll mid = s + e >> 1;

        bool ret = f(mid);

        if (ret == true) {

            ans = min(mid, ans);

            e = mid - 1;

        } else

            s = mid + 1;

    }

    cout << ans;

    return 0;

}

---