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;
    }
    所遇皆星河
  • 相关阅读:
    linux密码登陆时加入自己登陆验证模块(pam),xshell工具可用,xftp工具使用无响应
    新增sftp服务器及用户
    SFTP服务配置以及命令/代码操作
    【OpenSSH】internal-sftp和sftp-server之间的区别和联系什么?
    sshd_config 中文手册:关于ssh 设置的相关总结(ssh最大连接数、ssh连接时长、安全性配置等)
    CentOS下配置SFTP操作日志
    linux中pam认证解析
    linux密码登陆时加入自己登陆验证模块(pam)
    linux syslog详解
    Win2012 R2 IIS8.5+PHP(FastCGI)+MySQL运行环境搭建教程
  • 原文地址:https://www.cnblogs.com/Shallow-dream/p/11623526.html
Copyright © 2011-2022 走看看