Cod sursa(job #3166989)
Utilizator | Pirlog Marian Nicolae nicushor21 | Data | 9 noiembrie 2023 21:15:13 |
---|---|---|---|
Problema | Grupuri | Scor | 32 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.68 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int n,k,a[100000],i,maxim,st,dr,mid,pos;
long long suma;
int main(){
ifstream fin("grupuri.in");
ofstream fout("grupuri.out");
fin>>k>>n;
for(i=0;i<n;i++){
fin>>a[i];
suma+=a[i];
}
maxim=suma/k;
st=0; dr=n-1;
while(st<=dr){
mid=(st+dr)/2;
if(a[mid]>=maxim){
dr=mid-1;
pos=mid;
}else{
st=mid+1;
}
}
k=k-(n-pos);
suma=0;
for(i=0;i<pos;i++){
suma+=a[i];
}
maxim=suma/k;
fout<<maxim;
fin.close();
fout.close();
return 0;
}