Cod sursa(job #1803183)
Utilizator | Data | 11 noiembrie 2016 08:12:26 | |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int main()
{
int n,k,max,i,nr,sum,j;
f>>n >>k;
max=0;
for(i=1;i<=k;i++)
{
sum=0;
for(j=1;j<=i;j++)
{
f>>nr;
sum=sum+nr;
}
if(sum>max)
max=sum;
}
g<<max;
return 0;
}