Codeforces Round #238 (Div. 2) A题

2024-09-02 18:48

文章标签 codeforces round div 238

本文主要是介绍Codeforces Round #238 (Div. 2) A题，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

大水题，直接排序输出

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.

$\text{[math]}$

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 
input 
3
2 3 8
output 
2 3 8 

Note

The first example case is shown on the figure. The top cube of the first column falls to the top of the last column; the top cube of the second column falls to the top of the third column; the middle cube of the first column falls to the top of the second column.

In the second example case the gravity switch does not change the heights of the columns.

#include<stdio.h>
#include<cstring>
#include<algorithm>
#define max 101
int n;int cloum[max];
int main()
{//freopen("input.txt","r",stdin);while(~scanf("%d",&n)){for(int i=1;i<=n;i++)scanf("%d",&cloum[i]);std::sort(cloum+1,cloum+n+1);for(int i=1;i<=n;i++)printf("%d%c",cloum[i],i==n?'\n':' ');}return 0;
}