Cod sursa(job #3370920)
| Utilizator | Data | 27 octombrie 2026 20:07:02 | |
|---|---|---|---|
| Problema | Grupuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int s[100001];
int k, n;
int check(int val)
{
int nr=0;
for(int i=1; i<=n; i++)
{
nr+=min(val, s[i]);
}
return nr;
}
signed main() {
cin >> k >> n;
for(int i=1; i<=n; i++)
{
cin >> s[i];
}
int st=1;
int dr=1e9;
int sol;
while(st<=dr)
{
int mid = (st+dr)/2;
if(check(mid)>=k*mid)
{
sol=mid;
st=mid+1;
}else
{
dr=mid-1;
}
}
cout << sol;
return 0;
}
