Problem Solving

Pashmak and Flowers.cpp

#include <iostream>

using namespace std;

int main () {

    long long n;
    cin >> n;
    long ar[n];
    for (int i = 0; i < n; i++)
            cin >> ar[i];
    long min = ar[0];
    long max = ar[0];
    for (int i = 0; i < n; i++) {
        if (ar[i] > max)
            max = ar[i];
        else if (ar[i] < min)
            min = ar[i];
    }
    long beauty = max - min;
    long long ways, cnt1 = 0, cnt2 = 0;
    for (int i = 0; i < n; i++) {
        if (ar[i] == max)
            cnt1++;
        else if (ar[i] == min)
            cnt2++;
    }
    if (min == max)
        ways = n * (n - 1) / 2;
    else
        ways = cnt1 * cnt2;
    cout << beauty << " " << ways;

    return 0;
}