codeforces 651B Beautiful Paintings(贪心)

原创 2016年05月30日 23:36:06

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.

Sample Input

Input
5
20 30 10 50 40
Output
4
Input
4
200 100 100 200
Output

2

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
int n,i,j,sum,ans,a[1010],b[1010];
while(~scanf("%d",&n))
{
for(i=0;i<n;i++)
scanf("%d",&a[i]);
sort(a,a+n);
memset(b,0,sizeof(b));
sum=ans=0;
while(sum<n)
{
for(i=0;i<n;i++)
{
if(!b[i])
{
b[i]=1;
sum++;
break;
}
}
for(j=i+1;j<n;j++)
{
if(!b[j]&&a[j]>a[i])
{
b[j]=1;
ans++;
sum++;
i=j;
}
}
}
printf("%d\n",ans);
}
return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

Codeforces 651B Beautiful Paintings【贪心】水题

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

codeforces 651B Beautiful Paintings

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

codeforces 651B Beautiful Paintings (想法)

codeforces 651B Beautiful Paintings (想法)

Codeforces Round #345 (Div. 2) B. Beautiful Paintings【贪心】

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

Codeforces Round #345 (Div. 2)-B. Beautiful Paintings(暴力)

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

#345 Div2 B. Beautiful Paintings

第一次在CSDN上写博客,纪念一下。 这道题 virtual 的时候过了,不过时间用了比较久,比帆神久好多赛完后看了一下帆神的代码,竟然辣么短,而且不理解什么意思,百度了一下其他题解才弄明白 我的方法...

codeforces 651A Joysticks【贪心】

A. Joysticks time limit per test 1 second memory limit per test 256 megabytes input...

Codeforces Round #231 (Div. 2) B Very Beautiful Number(数字递推)

一看到题目的时候就感觉很有思路,后写了几次试了一下,感觉对了。可惜代码能力不够强,一直在dbug,最后才过了样例。但是感觉怪怪的,要过不了,最后真的卡在了24组数据上了啊。sad、、、又是细节没注意啊...

Codeforces_394B_Very Beautiful Number(数论)

B. Very Beautiful Number time limit per test 1 second memory limit per test 256 megabyte...

Codeforces Round #231 (Div. 2) B. Very Beautiful Number

B. Very Beautiful Number time limit per test 1 second memory limit per test 256 megabytes inpu...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)