Codeforces Round #261 (Div. 2) 459B - Pashmak and Flowers Solution

Solution in C++: 

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

#include <bits/stdc++.h>

using namespace std;

int main()

{

    ios::sync_with_stdio(false);

    cin.tie(0);

    long long int n,i,j,d,mn=0,mx=0;

    cin>>n;

    long long int a[n+9];

    for(i=0; i<n; i++)

    {

        cin>>a[i];

    }

    sort(a,a+n);

    d=a[n-1]-a[0];

    cout<<d<<" ";

    if(d==0)

    {

        cout<<(n*(n-1))/2<<endl;

        return 0;

    }

     mn=count(a,a+n,a[0]);

     mx=count(a,a+n,a[n-1]);

    cout<<mn*mx<<endl;

    return 0;

}