Cod sursa(job #2371983)
Utilizator | Ian David Bocioaca iandavidro | Data | 6 martie 2019 20:41:15 |
---|---|---|---|
Problema | Grupuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream f("grupuri.in");
ofstream g("grupuri.out");
long long S,st,dr,mid,sol;
int i,n,v[100001],k;
int valid(long long x){
S=0;
for(i=1;i<=n;i++){
if(v[i]<mid)
S+=v[i];
else
S+=mid;
}
if(S>=k*mid)
return 1;
return 0;
}
int main()
{ f>>k>>n;
for(i=1;i<=n;i++){
f>>v[i];
S+=v[i];
}
st=0;dr=S/k;
while(st<=dr){
mid=(st+dr)/2;
if(valid(mid)==1){
sol=mid;
st=mid+1;
}
else
dr=mid-1;
}
g<<sol;
return 0;
}