URAL 1290. Sabotage (sortings)
2015-06-22 11:44
309 查看
1290. Sabotage
Time limit: 1.0 secondMemory limit: 64 MB
It is the seventh year of the terrible harmful Galaxy War... Leo Hao is one of the first defenders of his planet. He is lucky! He has gone through many troubles. For example, he stayed alive after the close combat with a meklon
warrior – a perfect killing machine. He lost his left leg, right eye and spent five long months in hospital. After that incident, he had to leave the army and return to the Earth.
But Leo is lucky twice! He was able to find a good job after all these terrible incidents. Now he is a leading programmer in “U.S. Robots”. He was involved into the creation of software for zero level defense system. However,
even there he was faced with interplanetary intervention! Just a few days ago it was found out that one of his co-workers is not a human! No! Physically he was a human of course, but parasitical Darloxian – agent of the most odious race in the Galaxy, captured
his mind.
Obviously, mind corrupted by Darlok agent was not able to write high-quality code. That why Leo is now reviewing his code. It’s terrible!!! It is not effective, slow, dirty and tangled. It must be rewritten!
However, Leo faced trouble during the exploration of the following function: input is the array of positive integer numbers. First, function prints quantity of numbers in the array onto a sheet of paper. Then quantity of numbers
in the array greater than 1 is printed. Then quantity of numbers greater than 2 and so on, until the function encounters zero (zero is never printed out). After that, special mechanical manipulator puts this sheet of paper into scanner, which reads this set
of numbers into memory and the described operation repeats again. After that the new paper with numbers comes out from the printer. The scanner reads these new numbers, and stores them into the array. This array is the result of the function.
Example. Input: 4 1 6.
After first stage printer prints 3 2 2 2 1 1
After second stage the result of the function will be 6 4 1
Leo feels that it can be done more effectively. Your goal is to write a program, which will be able to replace the function written by Darlok agent, and will be much faster.
Input
First line of input contains the number N (0 ≤ N ≤ 25000). The next N lines contain integers pi (1 ≤ pi ≤ 25000) one per line. It is the input for the described function.Output
Output should contain the result of the function, written by Darlok Agent.Sample
input | output |
---|---|
3 4 1 6 | 6 4 1 |
Problem Source: IX Open Collegiate Programming Contest of the High School Pupils (13.03.2004)
解析:从大到小排序!!!
PS:URAL的题意总是描述的很绕,很不好懂。。。
AC代码:
#include <bits/stdc++.h> using namespace std; int a[25005]; int main(){ int n; while(scanf("%d", &n) != EOF){ for(int i = 0; i < n; i ++) scanf("%d", &a[i]); sort(a, a + n); for(int i = n-1; i >= 0; i --){ printf("%d\n", a[i]); } } return 0; }
相关文章推荐
- Coursera台大机器学习课程笔记4 -- Training versus Testing
- Android 下载文件及写入SD卡
- 用二分法求下面方程在(-10,10)之间的根:2x^3-4x^2+3x-6=0
- Hibernate缓存系列之详细测试
- groovy、java生成随机数32位
- 关于Core Location-ios定位
- java学习之旅04--第一个程序HelloWorld
- java提高篇(五)-----抽象类与接口
- Android:使用Gon解析解析Json
- js模块化开发----sea.js
- log4j中Pattern布局ConversionPattern详解
- mac下反编译apk
- __attribute__((packed))详解
- groovy grails 动态方法一例
- grails 通过applicationContext获取bean
- 关于coreLocation - 地理位置反向编码
- 表格排序
- Net中JSON序列化和反序列化处理(日期时间特殊处理)
- c++中的explicit
- grails默认全局gorm配置