part 2 ques 4

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
int arr[1000],n;
int* minmax()
{
    int mn=1e7, mx=-1e7;
    static int res[5];
    for(int i=0;i<n;i++)
    {
        if(mx<arr[i])
            mx = arr[i];
        if(mn>arr[i])
            mn = arr[i];
    }
    res[0]=mn;
    res[1]=mx;
    return res;
}

int main()
{
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif

    cin >> n;

    for(int i=0;i<n;i++)
        cin >> arr[i];
    int* ptr = minmax();
    printf("Minimum = %d & Maximum  = %d\n",ptr[0],ptr[1]);

    return 0;
}