# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1168530 | quangminh412 | Self Study (JOI22_ho_t2) | C++20 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
/*
Ben Watson
Handle codeforces : quangminh98
Mua Code nhu mua Florentino !!
*/
#define ll long long
const string name = "test";
void solve();
signed main()
{
if (fopen((name + ".inp").c_str(), "r"))
{
freopen((name + ".inp").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
solve();
return 0;
}
// main program
const int maxn = 3e5;
int n, m;
int a[maxn + 1], b[maxn + 1];
bool can(ll k)
{
ll require = 0;
for (int i = 1; i <= n; i++)
{
ll mx = max(a[i], b[i]);
if (mx * m >= k)
require += m - ((k + mx - 1) / mx);
else
require -= (k - mx * m + b[i] - 1) / b[i];
}
return (require >= 0);
}
void solve()
{
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i] >> b[i];
ll l = 0, r = 1e18;
ll res = -1;
while (l <= r)
{
ll mid = l + (r - l) / 2;
if (can(mid))
{
res = mid;
l = mid + 1;
} else
r = mid - 1;
}
cout << res << '\n';
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |