zoukankan      html  css  js  c++  java
  • C Reorder the Array (二分+multiset排序)

    You are given an array of integers. Vasya can permute (change order) its integers. He wants to do it so that as many as possible integers will become on a place where a smaller integer used to stand. Help Vasya find the maximal number of such integers.

    For instance, if we are given an array [10,20,30,40][10,20,30,40], we can permute it so that it becomes [20,40,10,30][20,40,10,30]. Then on the first and the second positions the integers became larger (20>1020>10, 40>2040>20) and did not on the third and the fourth, so for this permutation, the number that Vasya wants to maximize equals 22. Read the note for the first example, there is one more demonstrative test case.

    Help Vasya to permute integers in such way that the number of positions in a new array, where integers are greater than in the original one, is maximal.

    Input

    The first line contains a single integer nn (1n1051≤n≤105) — the length of the array.

    The second line contains nn integers a1,a2,,ana1,a2,…,an (1ai1091≤ai≤109) — the elements of the array.

    Output

    Print a single integer — the maximal number of the array's elements which after a permutation will stand on the position where a smaller element stood in the initial array.

    Examples

    Input
    7
    10 1 1 1 5 5 3
    Output
    4
    Input
    5
    1 1 1 1 1
    Output
    0

    Note

    In the first sample, one of the best permutations is [1,5,5,3,10,1,1][1,5,5,3,10,1,1]. On the positions from second to fifth the elements became larger, so the answer for this permutation is 4.

    In the second sample, there is no way to increase any element with a permutation, so the answer is 0.

     

    #include <iostream>
    #include <algorithm>
    #include <cstdio>
    #include <string>
    #include <cstring>
    #include <cstdlib>
    #include <map>
    #include <vector>
    #include <set>
    #include <queue>
    #include <stack>
    #include <cmath>
    typedef long long lli;
    using namespace std;
    const int  mxn = 1e9;
    multiset<int> v;
    multiset<int> :: iterator it ;
    int main()
    {
    
        int n,b,cnt=0;
        cin>>n;
        int a[n+5];
        for(int i=0; i<n; i++)
        {
            cin>>a[i];
            v.insert(a[i]);
        }
        for(int i=0; i<n; i++)
        {
            it = v.lower_bound(a[i]+1);
            if( it!=v.end() )
            {
                cnt++;
                v.erase(it);
            }
        }
        cout<<cnt<<endl;
        return 0;
    }
    所遇皆星河
  • 相关阅读:
    算法训练 2的次幂表示
    算法训练 进制转换
    算法训练 Beaver's Calculator (蓝桥杯)
    抽签问题(不断优化)
    矩阵快速幂
    斐波那契数列
    找出最小自然数N,使N!在十进制下包含Q个0(输入Q,输出N)
    二维数组名是指针的指针吗?
    StringBuffer
    Lake Counting (POJ No.2386)
  • 原文地址:https://www.cnblogs.com/Shallow-dream/p/11623526.html
Copyright © 2011-2022 走看看