sicily 1306. Sorting Algorithm
2015-10-30 20:35
471 查看
1306. Sorting Algorithm
Constraints
Time Limit: 1 secs, Memory Limit: 32 MBDescription
One of the fundamental problems of computer science is ordering a list of items. There're a plethora of solutions to this problem, known as sorting algorithms. Some sorting algorithms are simple andintuitive, such as the bubble sort. Others, such as the heap sort are not so simple, but produce lightening-fast results.
In the following is a list of some sorting algorithms. Of course, I can’t tell you how to implement them here. You must use your own knowledge.
Bubble sort
Heap sort
Insertion sort
Merge sort
Quick sort
Selection sort
Shell sort
…
My business here is to give you some numbers, and to sort them is your business. Attention, I want the smallest number at the top of the sorted list.
Input
The input file will consist of series data sets. Each data set has two parts. The first part contains two non-negative integers, n (1≤n≤100,000) and m (1≤m≤n), representing the total of numbers youwill get and interval of the output sorted list. The second part contains n positive integers. I am sure that each integer in this part will be less than 2,000,000,000.
The input is terminated by a line with two zeros.
Output
For one data set, you should output several numbers in ONE line. After you get the sorted list, you should output the first number of each m numbers, and you should print exact ONE space between twoadjacent numbers. And please make sure that there should NOT be any blank line between outputs of two adjacent data sets.
Sample Input
8 2357186420 0
Sample Output
1 3 5 7
题目分析
排序题
可以用库函数做
#include <iostream>
#include <algorithm>
int main()
{
int num, interval;
while (std::cin >> num >> interval) {
if (num == 0 && interval == 0)
break;
int digit[num];
for (int i = 0; i < num; ++i)
std::cin >> digit[i];
std::sort(digit, digit+num);
std::cout << digit[0];
for (int i = interval; i < num; i += interval)
std::cout << " " << digit[i];
std::cout << std::endl;
}
}
相关文章推荐
- D - Wine trading in Gergovia
- 2015南阳CCPC G - Ancient Go dfs
- UVALive 6886 Golf Bot
- Google图片搜索的原理
- Algorithms—208.Implement Trie (Prefix Tree)
- 浅析Go语言编程当中映射和方法的基本使用
- MIT算法导论——第一讲.Analysis of algorithm
- goolge官方推荐图片加载框架glide使用介绍
- Django 中的用户认证
- Django运行方式及处理流程总结
- django 简单的邮件系统
- django 注册、登录及第三方接口程序(3):验证之正则表达式
- django 注册、登录及第三方接口程序(2):扩展User表
- django 注册、登录及第三方接口程序(1):基础知识
- Go语言中函数的参数传递与调用的基本方法
- django 一些相关问题
- Go语言流程控制之goto语句与无限循环
- Django 源码小剖: 应用程序入口 WSGIHandler
- Django 源码小剖: Django 中的 WSGI
- Emacs中多个golang项目的配置方法