首页
学习
活动
专区
圈层
工具
发布
首页
学习
活动
专区
圈层
工具
MCP广场
社区首页 >专栏 >【CodeForces】651B - Beautiful Paintings(暴力)

【CodeForces】651B - Beautiful Paintings(暴力)

作者头像
FishWang
发布2025-08-26 20:24:31
发布2025-08-26 20:24:31
10500
代码可运行
举报
运行总次数:0
代码可运行

题目链接:点击打开题目

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

代码语言:javascript
代码运行次数:0
运行
复制
5
20 30 10 50 40

output

代码语言:javascript
代码运行次数:0
运行
复制
4

input

代码语言:javascript
代码运行次数:0
运行
复制
4
200 100 100 200

output

代码语言:javascript
代码运行次数:0
运行
复制
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.

数据才1000,两次for循环暴力计算使之递增即可。

代码如下:

代码语言:javascript
代码运行次数:0
运行
复制
#include <cstdio>
int main()
{
	int n;
	int a[1111] = {0};
	int ans = 0;
	scanf ("%d",&n);
	while (n--)
	{
		int t;
		scanf ("%d",&t);
		a[t]++;
	}
	for (int i = 1 ; i <= 1000 ; i++)
	{
		int cnt = 0;
		for (int i = 1 ; i <= 1000 ; i++)
		{
			if (a[i])
			{
				cnt++;
				a[i]--;
			}
		}
		if (cnt == 1 || cnt == 0)
			break;
		ans += cnt - 1;
	}
	printf ("%d\n",ans);
	return 0;
}
本文参与 腾讯云自媒体同步曝光计划,分享自作者个人站点/博客。
原始发表:2016-05-25,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体同步曝光计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档