497A - Reorder The Array.cpp

#include <iostream>
#include <string>
#include <utility>
#include <sstream>
#include <algorithm>
#include <stack>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <math.h>
#include <assert.h>

using namespace std;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define INF 1000000000
#define LL_INF 4500000000000000000
#define LSOne(S) (S & (-S))
#define EPS 1e-9
#define A first
#define B second
#define mp make_pair
#define pb push_back
#define PI acos(-1.0)
#define ll long long
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;

int main() {
    int n; cin >> n;
    int nums[n]; for (int i = 0; i < n; i++) cin >> nums[i];
    multiset<int> sorted; for (int i = 0; i < n; i++) sorted.insert(nums[i]);
    int ans = 0;
    for (int num : nums) {
        auto it = sorted.upper_bound(num);
        if (it == sorted.end()) continue;
        sorted.erase(it);
        ans++;
    }
    cout << ans << endl;
    return 0;
}