Pagini recente » Cod sursa (job #159637) | Cod sursa (job #506860) | Cod sursa (job #3252640) | Cod sursa (job #1854603) | Cod sursa (job #885881)
Cod sursa(job #885881)
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
inline int max(int a, int b)
{
if(a>b) return a;
return b;
}
inline int min(int a, int b)
{
if(a<b) return a;
return b;
}
int n,k;
int a[16001],vmin,vmax;
int ls,ld;
int main()
{
f>>n>>k;
for(int i=1; i<=n; i++)
f>>a[i],vmin=max(vmin, a[i]),vmax=min(vmax,a[i]);
//f>>a[i], if(v[i]>ls) ls=v[i],ld+=v[i];
g<<vmin+vmax;
/*
while(ls<ld)
{
}
*/
return 0;
}