Cod sursa(job #2396170)
Utilizator | Data | 3 aprilie 2019 11:42:46 | |
---|---|---|---|
Problema | Grupuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream cin("grupuri.in");
ofstream cout("grupuri.out");
long long n,k,v[100005],s,st=1,dr,mid,ans;
int main()
{
cin>>k>>n;
for(int i=1;i<=n;i++){
cin>>v[i];
s+=v[i];
}
dr=s;
while(st<=dr){
mid=(st+dr)/2;
s=0;
for(int i=1;i<=n;i++)
s+=min(v[i],mid);
if(mid*k<=s){
ans=mid;
st=mid+1;
}
else
dr=mid-1;
}
cout<<ans;
return 0;
}