Pagini recente » Cod sursa (job #1617161) | Cod sursa (job #2820944) | Cod sursa (job #1325278) | Cod sursa (job #1113246) | Cod sursa (job #1379064)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("garaj.in");
ofstream fout("garaj.out");
int sol,st,dr,i,n,m,a[200][2];
long long mij;
int check(int mij)
{
long int sol=0;
for(i=1;i<=n;i++)
{
sol+=1ll*a[i][0]*(mij/a[i][1]);
if(sol>=1ll*m)
return 1;
}
return 0;
}
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
{
fin>>a[i][0]>>a[i][1];
a[i][1]=a[i][1]*2;
}
st=1;
dr=2000000000;
while(st<=dr)
{
mij=(st+dr)/2;
if(check(mij))
{
dr=mij-1;
sol=mij;
}
else
st=mij+1;
}
fout<<sol;
return 0;
}