#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll T[10000007];
ll P[10000007];
ll ans[10000007];
ll n, m, k;
bool cmp(ll a, ll b){return a > b;}
ll check(ll ti)
{
ll i;
for(i = 1; i <= m; i++)
{
if(ti < T[i])ans[i] = 0;
else ans[i] = (ti - T[i]) / P[i] + 1;
}
sort(ans + 1, ans + 1 + m, cmp);
ll sum = 0;
for(i = 1; i <= min(n, m); i++)sum += ans[i];
if(sum >= k)return 1;
else return 0;
}
ll fin(ll l, ll r)
{
if(l == r)return l;
ll mid = (l + r) / 2;
if(check(mid))return fin(l, mid);
else return fin(mid + 1, r);
}
int main()
{
ll t, i, j;
scanf("%lld", &t);
while(t--)
{
scanf("%lld %lld %lld", &m, &n, &k);
for(i = 1; i <= m; i++)scanf("%lld", &T[i]);
for(i = 1; i <= m; i++)scanf("%lld", &P[i]);
ll ans = fin((ll)1, (ll)1e9);
printf("%lld\n", ans);
}
return 0;
}
CodeChef - SQUIRREL Squirrel and chestnut (二分答案)
猜你喜欢
转载自blog.csdn.net/Miracle_QSH/article/details/82192373
今日推荐
周排行