Codeforces Round #497 (Div. 1) (A. Reorder the Array)

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()

{

    set<ll>st;

    ll n;

    cin>>n;

    ll arr[n+3],vis[n+9],start=0,cnt=0;

    for(ll i=0;i<n;i++) cin>>arr[i],vis[i]=0,st.insert(arr[i]);

    sort(arr,arr+n);

    if(st.size()==1)

    {

        cout<<"0"<<endl;

        return 0;

    }

    for(ll i=0;i<n && start<n;i++)

        for(ll j=start;j<n;j++)

            if(arr[i]<arr[j] && vis[j]==0)

            {

                start=j,vis[j]=1,cnt++;

                break;

            }

    cout<<cnt<<endl;

    return 0;

}

///Alhamdulillah

Problem Link: https://codeforces.com/problemset/problem/1007/A