Răspuns :
#include <iostream>
using namespace std;
int main()
{
int v[1000], n,MAX, MIN, ok=1;
cin >> n;
for (int i = 0; i<n; i++)
{
cin >> v[i];
}
for (int i = 0; i<n; i++)
{
if (ok == 1){MAX = v[i];MIN = v[i];ok=0;}
else
{
if (v[i]>MAX){MAX=v[i];}
if (v[i]<MIN){MIN=v[i];}
}
}
cout << MIN << " " << MAX;
return 0;
}
using namespace std;
int main()
{
int v[1000], n,MAX, MIN, ok=1;
cin >> n;
for (int i = 0; i<n; i++)
{
cin >> v[i];
}
for (int i = 0; i<n; i++)
{
if (ok == 1){MAX = v[i];MIN = v[i];ok=0;}
else
{
if (v[i]>MAX){MAX=v[i];}
if (v[i]<MIN){MIN=v[i];}
}
}
cout << MIN << " " << MAX;
return 0;
}
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
main()
{
int n;
cin >> n;
vector <int> a(n);
for (int i=0; i<a.size(); i++)
cin >> a[i];
cout<<*min_element(a.begin(),a.end())<<' '<<*max_element(a.begin(),a.end());
}
#include <vector>
#include <algorithm>
using namespace std;
main()
{
int n;
cin >> n;
vector <int> a(n);
for (int i=0; i<a.size(); i++)
cin >> a[i];
cout<<*min_element(a.begin(),a.end())<<' '<<*max_element(a.begin(),a.end());
}