CodeForces 651B Beautiful Paintings
2016-06-07 12:17
344 查看
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
output
input
output
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<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
bool cmp(int a,int b)
{
return a<b;
}
int main()
{
int a[1010],vis[1010];
int n;
while(scanf("%d",&n)!=EOF)
{
int num=0;
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
memset(vis,0,sizeof(vis));
sort(a,a+n,cmp);
for(int i=0;i<n;i++)
{
int falg=a[i];
for(int j=i+1;j<n;j++)
bf39
if(a[j]>falg&&vis[j]==0)
{
num++;
vis[j]=1;
break;
}
}
printf("%d\n",num);
}
return 0;
}
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
4200 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<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
bool cmp(int a,int b)
{
return a<b;
}
int main()
{
int a[1010],vis[1010];
int n;
while(scanf("%d",&n)!=EOF)
{
int num=0;
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
memset(vis,0,sizeof(vis));
sort(a,a+n,cmp);
for(int i=0;i<n;i++)
{
int falg=a[i];
for(int j=i+1;j<n;j++)
bf39
if(a[j]>falg&&vis[j]==0)
{
num++;
vis[j]=1;
break;
}
}
printf("%d\n",num);
}
return 0;
}
相关文章推荐
- Windows Server 2008配置Jmail发送邮件
- 336. Palindrome Pairs
- container-with-most-water
- Contains方法,查看序列中是否包含某个元素
- maildir 邮件文件名 记录
- 国外十大高校人工智能实验室及其代表性人物一览
- 安卓"failed: dlopen failed: could not load library "libpthread.so.0" needed by ***"的个人了解
- 人工智能(AI)资料大全
- Leetcode-70. Climbing Stairs
- 用Grails写单元测试
- [Leetcode]70. Climbing Stairs
- [Leetcode]172. Factorial Trailing Zeroes
- [Leetcode]217. Contains Duplicate
- Neo4j索引笔记之SchemaIndex和LegacyIndex
- 193_AIDL的使用
- Grails用CONSOLE测试,比写集成测试还快
- vector中pair的排序方法
- 196. Delete Duplicate Emails
- [转载] fail-fast总结(通过ArrayList来说明fail-fast的原理、解决办法)
- Rails中force index