768A - Oath of the Nights Watch

#include <iostream>

#include<vector>

#include<string>

#include<math.h>

#include<set>

#include<map>

#include<algorithm>

/***** S. M. Sabiul Hajjaj Sabit *****/

using namespace std;

template <typename T>long long int power(T a, T b)

{

    long long int pow=1;

    for(int i=0; i<b; i++)

    {

        pow *= a;

    }

    return pow;

}

///*********Write Code From Here*********///

int main()

{

    int n;

    vector<int> arr;

    int count=0;

    cin>>n;

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

    {

        int t;

        cin>>t;

        arr.push_back(t);

    }

    sort(arr.begin(),arr.end());

    int a =arr[0];

    int b=arr[n-1];

    for(int i=1; i<n-1; i++)

    {

        if(arr[i]>a && arr[i]<b)

            count++;

    }

    cout<<count<<endl;

}