数据结构与算法习题 replacement selection sort(置换选择排序)

最新推荐文章于 2023-06-01 10:43:31 发布

pku_zzy

最新推荐文章于 2023-06-01 10:43:31 发布

阅读量4.6k

点赞数 2

分类专栏： Algorithm

本文链接：https://blog.csdn.net/PKU_ZZY/article/details/53148630

版权

该博客介绍了如何使用二元最小堆实现置换选择排序，给出了一组示例输入和输出，详细阐述了该排序方法在数据处理过程中的具体步骤，特别是如何在缓存区管理和输出有序序列。

摘要由CSDN通过智能技术生成

数据结构与算法习题 replacement selection sort(置换选择排序)

Time Limit: 1000ms Memory Limit: 65536kB
Description
Given an original run made up of intergers, and a binary minimumheap，you are required touse the heap to implement the replacement selection sort, and output the firstrun. For example, given a run of 29,14,35,13 and a heap(marked as16,19,31,25,21,56,40), the first run got by using replacement selection sort will be 16,19,21,25.
这里写图片描述
Input
The first line contains two intergers m and n, m is the number of the elements of the original run, n is the size of the binary minimum heap.
The second line contains m intergers, that is the original run.
The third line contains n intergers, the elements of the heap that has been constructed(in order, from the top of the heap to the bottom of the heap, from left to right)
Output
The output contains on