Cod sursa(job #3245567)
Utilizator | Data | 29 septembrie 2024 13:58:08 | |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.32 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int main()
{
int n,k,i,v[16001],maxi;
cin>>n>>k;
for(i=1;i<=n;i++)
cin>>v[i];
sort(v+1,v+n+1);
for(i=1;i<=n;i++)
{
maxi=v[n];
}
cout<<maxi+1;
}