菜单 学习猿地 - LMONKEY

VIP

开通学习猿地VIP

尊享10项VIP特权 持续新增

知识通关挑战

打卡带练!告别无效练习

接私单赚外块

VIP优先接,累计金额超百万

学习猿地私房课免费学

大厂实战课仅对VIP开放

你的一对一导师

每月可免费咨询大牛30次

领取更多软件工程师实用特权

入驻
93
0

codeforces Gravity Flip 题解

原创
05/13 14:22
阅读数 25465

标签:style   blog   class   code   ext   color   

Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity.

There are n columns of toy cubes in the box arranged in a line. The i-th column contains ai cubes. At first, the gravity in the box is pulling the cubes downwards. When Chris switches the gravity, it begins to pull all the cubes to the right side of the box. The figure shows the initial and final configurations of the cubes in the box: the cubes that have changed their position are highlighted with orange.

bubuko.com,布布扣

Given the initial configuration of the toy cubes in the box, find the amounts of cubes in each of the n columns after the gravity switch!

Input

The first line of input contains an integer n (1?≤?n?≤?100), the number of the columns in the box. The next line contains n space-separated integer numbers. The i-th number ai (1?≤?ai?≤?100) denotes the number of cubes in the i-th column.

Output

Output n integer numbers separated by spaces, where the i-th number is the amount of cubes in the i-th column after the gravity switch.

Sample test(s)
input
4
3 2 1 2
output
1 2 2 3 

原来可以这么改变gravity,形成这样的效果的,有意思。

不过题解却是很容易的,就是一个排序问题,O(∩_∩)O~,但是没看到这样的题目还真没想过。

void GravityFlip()
{
	unsigned n;
	cin>>n;
	int *A = new int[n];

	for (unsigned i = 0; i < n; i++)
	{
		cin>>A[i];
	}

	sort(A, A+n);
	for (unsigned i = 0; i < n; i++)
	{
		cout<<A[i]<<‘ ‘;
	}

	delete [] A;
}




codeforces Gravity Flip 题解,布布扣,bubuko.com

codeforces Gravity Flip 题解

发表评论

0/200
93 点赞
0 评论
收藏
为你推荐 换一批