Cod sursa(job #2574048)
Utilizator | Data | 5 martie 2020 20:07:51 | |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include<iostream>
using namespace std;
int n, m, v[1005];
bool ok(int x)
{
int pachete=0;
for(int i=1; i<=n; i++)
{
pachete+=x/v[i];
}
return pachete>=m;
}
int main()
{
int st=1, dr=1000000, mij;
cin>>n>>m;
for(int i=1; i<=n; i++)
{
cin>>v[i];
}
while(st<dr)
{
mij=(st+dr)/2;
if(ok(mij))
{
dr=mij;
}
else
{
st=mij+1;
}
}
cout<<st;
return 0;
}