Nu exista pagina, dar poti sa o creezi ...
Cod sursa(job #1329265)
Utilizator | Data | 29 ianuarie 2015 12:17:49 | |
---|---|---|---|
Problema | Transport | Scor | 20 |
Compilator | cpp | Status | done |
Runda | prega_oji2015_ix_3 | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
#include <cstdio>
using namespace std;
ofstream g("transport.out");
int n,k,amax,s,a,i;
int main()
{
freopen("transport.in","r",stdin);
scanf("%d" "%d",&n,&k);
amax=0;
for(i=1;i<=n;i++)
{
scanf("%d",&a);
s=s+a;
if(a>amax)
amax=a;
}
if(s/k>amax)
{
g<<s/k;
}
else g<<amax;
return 0;
}