zoukankan      html  css  js  c++  java
  • CodeForces

    Time Limit: 1000MS   Memory Limit: 262144KB   64bit IO Format: %I64d & %I64u

     Status

    Description

    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.

    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 Input

    Input
    4
    3 2 1 2
    Output
    1 2 2 3 
    Input
    3
    2 3 8
    Output
    2 3 8 

    Hint

    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.

    Source

    题意:把题目翻译一下,就是从小到大排序。
    #include <iostream>
    #include <stdlib.h>
    #include <stdio.h>
    #include <algorithm>
    #include <string.h>
    #include <math.h>
    using namespace std;
    int main()
    {
        int i,n,a[105];
        while (cin>>n)
        {
            for (i=0;i<n;i++)
            cin>>a[i];
            sort(a,a+n);
            for (i=0;i<n-1;i++)
            cout<<a[i]<<" ";
            cout<<a[i]<<endl;
        }
        return 0;
    }
  • 相关阅读:
    npx 是什么?
    JavaScript 的内置对象和浏览器对象
    JS构造函数new的过程
    git 设置和取消代理
    npm配置镜像、设置代理
    SQL 注入攻击案例
    javascript:void(0);的含义以及使用场景
    让所有网页图片跳起舞来的代码
    针对Web的攻击技术
    网站常见的鉴权认证方式有哪几种?
  • 原文地址:https://www.cnblogs.com/Ritchie/p/5425033.html
Copyright © 2011-2022 走看看