Pagini recente » Cod sursa (job #596164) | Cod sursa (job #1318567) | Cod sursa (job #1367152) | Cod sursa (job #1010872) | Cod sursa (job #2666113)
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <queue>
#include <climits>
#include <string.h>
#include <algorithm>
using namespace std;
#define ll unsigned long long int
ifstream f("grupuri.in");
ofstream o("grupuri.out");
vector<int>v;
int k, n;
int s;
int eok(int x)
{
int cate = 0;
for (size_t i = 0; i < n; i++)
{
cate += min(x, v[i]);
}
return cate / k;
}
int main()
{
f >> k >> n;
for (size_t i = 0; i < n; i++)
{
int x;
f >> x;
v.push_back(x);
s += x;
}
int stanga = 0;
int dreapta = s;
while (stanga < dreapta - 1)
{
int mijloc = (stanga + dreapta) / 2;
if (eok(mijloc) < k)
{
stanga = mijloc;
}
else
{
dreapta = mijloc;
}
}
o << dreapta;
}