Codeforces Round #529 (Div. 3) (B. Array Stabilization)

Bismillahir Rahmanir Rahim

///Author: Tanvir Ahmmad

///CSE,Islamic University,Bangladesh

#include<iostream>

#include<cstdio>

#include<algorithm>

#include<string>

#include<cstring>

#include<sstream>

#include<cmath>

#include<cstring>

#include<vector>

#include<queue>

#include<map>

#include<set>

#include<stack>

#include<vector>

#include<iterator>

#include <functional> ///sort(arr,arr+n,greater<int>()) for decrement of array

/*every external angle sum=360 degree

  angle find using polygon hand(n) ((n-2)*180)/n*/

///Floor[Log(b)  N] + 1 = the number of digits when any number is represented in base b

using namespace std;

typedef long long ll;

int main()

{

    ll n;

    cin>>n;

    ll arr[n+3];

    for(ll i=0;i<n;i++) cin>>arr[i];

    sort(arr,arr+n);

    if(n==2) cout<<"0"<<endl;

    else

        cout<<min(abs(arr[1]-arr[n-1]),abs(arr[0]-arr[n-2]))<<endl;

    return 0;

}

///Alhamdulillah

Problem Link: https://codeforces.com/contest/1095/problem/B