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;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/z2664836046/article/details/51542148

Codeforces 651B Beautiful Paintings【贪心】

题意:给定序列,重新排序,使严格上升的子序列最多。求这些子序列总长度。分析:贪心,统计每个元素出现次数,每次从剩余的小的开始抽到大的,直到不再剩余元素。代码:#include #include usi...
  • Yukizzz
  • Yukizzz
  • 2016-03-12 09:33:50
  • 185

codeforces 651B Beautiful Paintings(贪心)

大意:给定一列数问排列任意改变顺序使(a[i+1]>a[i])的最多数目。思路:n为1000,1...
  • Grit_ICPC
  • Grit_ICPC
  • 2016-03-11 14:13:23
  • 194

【CodeForces】651B - Beautiful Paintings

Description There are n pictures delivered for the new exhibition. The i-th painting has beauty a...
  • z1192277815
  • z1192277815
  • 2016-05-27 08:50:09
  • 267

CodeForces 651B Beautiful Paintings

B. Beautiful Paintings time limit per test 1 second memory limit per test 256 megabytes input ...
  • neversayno_yl
  • neversayno_yl
  • 2016-06-07 12:17:33
  • 116

codeforces 651B Beautiful Paintings

B. Beautiful Paintings time limit per test 1 second memory limit per test 256 megabytes ...
  • EventQueue
  • EventQueue
  • 2016-03-26 12:52:06
  • 471

CodeForces 651B Beautiful Paintings

CodeForces 651B Beautiful Paintings
  • Dacc123
  • Dacc123
  • 2016-04-04 17:59:47
  • 595

【CodeForces】[651B]Beautiful Paintings

刚开始以为是简单的排序 后来发现是重新排列后 只要有 a[i+1]>a[i]变使cnt++ 所以最优排列方法可以是 类似于12312312323333这种...
  • u011493189
  • u011493189
  • 2016-05-30 00:00:28
  • 133

Codeforces 651B Beautiful Paintings【贪心】水题

B. Beautiful Paintings time limit per test 1 second memory limit per test 256 megabytes input sta...
  • mengxiang000000
  • mengxiang000000
  • 2016-10-24 21:49:30
  • 517

【CodeForces 651B】Beautiful Paintings 排序+贪心

题目大意: 给定集合AA,对于任意一个AA的排列(a1,a2,...,an)(a_1,a_2,...,a_n),记S(a)=cnt(ai...
  • y20070316
  • y20070316
  • 2016-03-18 13:23:40
  • 202
收藏助手
不良信息举报
您举报文章:codeforces 651B Beautiful Paintings(贪心)
举报原因:
原因补充:

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