Cod sursa(job #2358539)
Utilizator | Data | 28 februarie 2019 10:07:21 | |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<fstream>
using namespace std;
ifstream f("transport.in"):
ofstream g("transport.out");
long long n,k,a[100001],i,maxim=0,gasit=0,s=0;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
if(a[i]>maxim)
maxim=a[i];
for(i=1;i<=n;i++)
s=s+a[i];
for(i=maxim;i<=10000001 && gasit==0;i++)
if(i*k>s+1)
{
g<<i;
gasit=1;
}
return 0;
}