题目:
输入
样例1:
3 2 5
5 1 2
1 2 1
样例2:
3 2 5
5 1 2
1 1 1
样例
样例1:
4
样例2:
3
考察知识点:二分答案
思路:
二分答案 ‘最小等待时间’ ,对于每个等待时间,统计出m棵树各自在这个时间范围内能产出的果子数,再选择前n棵产出数最多的树,将最后这n棵树总共产出的果子数加和与k比较
代码:
'算法' 二分 ( times:89ms )
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e6 + 10;
int t[N], p[N];
int cnt[N];
int n, m, k;
bool cmp(int a, int b)
{
return a > b;
}
bool check(int tim)
{
for (int i = 1; i <= m; i++)
{
if (tim < t[i])
cnt[i] = 0;
else
cnt[i] = (tim - t[i] + p[i]) / p[i];
}
sort(cnt + 1, cnt + 1 + m, cmp);
int sum = 0;
for (int i = 1; i <= n; i++)
sum += cnt[i];
if (sum >= k)
return true;
return false;
}
signed main()
{
scanf("%lld%lld%lld", &m, &n, &k);
for (int i = 1; i <= m; i++)
scanf("%lld", &t[i]);
for (int i = 1; i <= m; i++)
scanf("%lld", &p[i]);
int l = 1, r = 1e9;
while (l < r)
{
int mid = l + r >> 1; //(l+r)/2
if (check(mid))
r = mid; // check()判断mid是否满足性质
else
l = mid + 1;
}
printf("%lld", l);
return 0;
}