zoukankan      html  css  js  c++  java
  • codeforces 651B B. Beautiful Paintings

    B. Beautiful Paintings
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    There are n pictures delivered for the new exhibition. The i-th painting has beauty ai. We know that a visitor becomes happy every time he passes from a painting to a more beautiful one.

    We are allowed to arranged pictures in any order. What is the maximum possible number of times the visitor may become happy while passing all pictures from first to last? In other words, we are allowed to rearrange elements of a in any order. What is the maximum possible number of indices i (1 ≤ i ≤ n - 1), such that ai + 1 > ai.

    Input

    The first line of the input contains integer n (1 ≤ n ≤ 1000) — the number of painting.

    The second line contains the sequence a1, a2, ..., an (1 ≤ ai ≤ 1000), where ai means the beauty of the i-th painting.

    Output

    Print one integer — the maximum possible number of neighbouring pairs, such that ai + 1 > ai, after the optimal rearrangement.

    Examples
    input
    5
    20 30 10 50 40
    output
    4
    input
    4
    200 100 100 200
    output
    2
    Note

    In the first sample, the optimal order is: 10, 20, 30, 40, 50.

    In the second sample, the optimal order is: 100, 200, 100, 200.

    题意:要你把这些数能排成多少个上升序列,最后用数的个数减去序列的个数就是结果,所以序列尽量少;

    AC代码:

    #include <bits/stdc++.h>
    using namespace std;
    const int N=1005;
    int a[N],flag[N];
    int main()
    {
        int n;
        scanf("%d",&n);
        memset(flag,0,sizeof(flag));
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
        }
        sort(a,a+n);
        for(int i=0;i<n;i++)
        {
            flag[a[i]]++;
        }
        int ans=0;
        while(n)
        {
            int num=0;
            for(int i=1;i<=1000;i++)
            {
                if(flag[i]>0)
                {
                    flag[i]--;
                    num++;
                    n--;
                }
            }
            ans+=num-1;
        }
        printf("%d
    ",ans);
    
        return 0;
    }
  • 相关阅读:
    nginx 附件上传不上去 client_max_body_size 设置的太小
    python 1
    NGINX 常用配置
    Linux OOM Killer 保护机制
    MacbookPro接上HDM连接显示器不能上网的解决方法
    python 逻辑运算符 () > not > and > or
    TASSL 服务端 客户端测试代码
    SSL通信双方如何判断对方采用了国密
    C/S boringSSL那点事
    从Chrome源码看浏览器的事件机制
  • 原文地址:https://www.cnblogs.com/zhangchengc919/p/5252248.html
Copyright © 2011-2022 走看看