1.
b)
2.
5 7 15
3.
#include <iostream>
using namespace std;
int main() {
size_t i, n;
cin >> n;
int *v = new int[n];
for (i = 0; i < n; ++i)
cin >> v[i];
int max = v[n - 1];
for (i = 0; i < n - 1; ++i)
if (v[i] > max)
max = v[i];
cout << max;
delete[] v;
}
