Pagini recente » Cod sursa (job #911487) | Borderou de evaluare (job #1791821) | Cod sursa (job #3301252) | Cod sursa (job #3348142) | Cod sursa (job #3333168)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,i;
int main()
{
fin>>n>>k;
vector<int> v(n);
int s=0, mn=0;
for(i=0;i<n;i++) {
fin>>v[i];
s+=v[i];
if(v[i]<mn) mn=v[i];
}
int l=mn;
int r=s;
int mij;
vector<int> w(l+r+1);
for(i=l;i<=r;i++) w[i]=i;
do{
mij=(l+r)/2;
if(s/w[mij]>k){
l=mij;
}
else r=mij;
}while(l<=r);
fout<<v[mij];
return 0;
}