Cod sursa(job #2127245)
Utilizator | Data | 10 februarie 2018 14:58:36 | |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp | Status | done |
Runda | codebreaking_1 | Marime | 0.47 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int main()
{
int n, k, s = 0, maxi = 0, x;
fin >> n >> k;
for(int i = 0; i < n; i++)
{
fin >> x;
s += x;
if(x > maxi)
maxi = x;
}
if(n == k)
fout << maxi;
else {
int z = s / k;
fout << min(z, maxi) * 2 - max(z, maxi);
}
}