Pagini recente » Cod sursa (job #2452586) | Cod sursa (job #2246594) | Cod sursa (job #238285) | Cod sursa (job #319162) | Cod sursa (job #2910860)
#include <fstream>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <climits>
#include <ctype.h>
#define MAX 100000000
using namespace std;
//ifstream f("in.in");
//ofstream g("out.out");
ifstream f("grupuri.in");
ofstream g("grupuri.out");
long long k,n,sol=0,v[100005];
bool solve(long long num){
long long s=0;
for(long long i=1;i<=n;i++){
s+=min(num,v[i]);
}
if(s>=num*k){
return 1;
}
return 0;
}
int main(){
f>>k>>n;
for(long long i=1;i<=n;i++){
f>>v[i];
}
long long st=0,dr = 100005;
while(st<=dr){
int mij = (st+dr)/2;
if(solve(mij)==1){
sol=mij;
st = mij+1;
}else{
dr=mij-1;
}
}
g<<sol;
f.close();
g.close();
return 0;
}