Pagini recente » Clasament lasm-bataj2-10 | Cod sursa (job #1532619) | Cod sursa (job #1283431) | Cod sursa (job #1111238) | Cod sursa (job #3258745)
#include<fstream>
#include<map>
#include<string>
#include<algorithm>
#include<climits>
using namespace std;
ifstream fin("grupuri.in");
ofstream fout("grupuri.out");
int main(){
int k,n,i,v[10002],st,dr,mij,s=0,rez;
fin>>k>>n;
for(i=1;i<=n;i++){
fin>>v[i];
sum+=v[i];
}
st=1;
dr=sum;
while(st<=dr){
mij=(st+dr)/2;
for(i=1,s=0;i<=n;i++)
s+=min(v[i],mij);
if(s>=mij*k){
rez=mij;
st=mij+1;
}
else
dr=mij-1;
}
fout<<rez;
}