RT

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin>>n; 
    array<int,110000> a;
    multiset<int> m;
    vector<int> b;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        m.insert(a[i]);
        b.push_back(a[i]);
    }
    stable_sort(a.begin(),a.end());
    unique(b.begin(),b.end());
    if(b.size()==1)cout<<0;
    else cout<<n-m.count(a.at(1))-m.count(a.at(n));
    return 0;
}

用STL改了一下，满江红