Cod sursa(job #3279507)
| Utilizator | Data | 23 februarie 2025 13:02:47 | |
|---|---|---|---|
| Problema | Grupuri | Scor | 74 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("grupuri.in");
ofstream fout("grupuri.out");
int a[100005],n,k;
int main()
{
int i,s=0,st,dr,mij,suma=0,sol=0;
fin >> k >> n;
for(i=1;i<=n;i++)
{
fin >> a[i];
s += a[i];
}
dr = s/k;///grup maxim
st = 0;///grup minim
while (st <= dr)
{
suma = 0;
mij = (st + dr) / 2;
for(i=1;i<=n;i++)suma += min(a[i], mij);
cout << suma << " " << mij <<'\n';
if (suma >= 1ll * mij * k)
st = mij+1;
else
dr = mij - 1;
}
fout << dr;
return 0;
}