Pagini recente » Cod sursa (job #2896871) | Cod sursa (job #2155117) | Cod sursa (job #135060) | Cod sursa (job #2749546) | Cod sursa (job #2581490)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream f("fabrica.in");
ofstream g("fabrica.out");
int n,nra,nrb,a[50005],b[50005];
bool check1(long long int val)
{long long int sol=0;
for(int i=1;i<=nra;i++)
{
sol=sol+1LL*val/a[i];
if(sol>=n) return 1;
}
//if(sol>=n) return 1;
return 0;
}
long long int solve1()
{
long long int st=1,dr=INT_MAX,mij,rasp;
while(st<dr)
{
mij=(st+dr)/2;
if(check1(mij)==1)
{
dr=mij-1;
rasp=mij;
}
else
{
st=mij+1;
}
}
return rasp;
}
int main()
{
f>>n>>nra>>nrb;
for(int i=1;i<=nra;i++)
{
f>>a[i];
}
for(int i=1;i<=nrb;i++)
{
f>>b[i];
}
int sol1=solve1();
g<<sol1<<" "<<sol1;
}