Pagini recente » Cod sursa (job #228560) | Cod sursa (job #139839) | Cod sursa (job #1048080)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
bool ok(int test);
int sum=0,nr,tr;
int main()
{
int nr,tr;
ifstream in ("transport.in" );
ofstream out ("transport.out");
in>>nr>>tr;
int* vv=new int[nr];
int max=1,sum=0;
for (int i=0;i<nr;i++)
{
in>>vv[i];
sum+=vv[i];
if(vv[i]>max)
max=vv[i];
}
for(int i=0;i<sum;i++)
if(max+i<sum&&ok(max+1))
max+=i;
if(ok(max))
out<<max;
else
out<<max+1;
in.close();
out.close();
return 0;
}
bool ok(int test)
{
if (sum>test)
return 1;
else
return 0;
}