1029. Median (25)【排序】——PAT (Advanced Level) Practise
2015-12-02 21:52
495 查看
题目信息
1029. Median (25)时间限制400 ms
内存限制65536 kB
代码长度限制16000 B
Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1={11, 12, 13, 14} is 12, and the median of S2={9, 10, 15, 16, 17} is 15. The median of two sequences is defined to be the median of the nondecreasing sequence which contains all the elements of both sequences. For example, the median of S1 and S2 is 13.
Given two increasing sequences of integers, you are asked to find their median.
Input
Each input file contains one test case. Each case occupies 2 lines, each gives the information of a sequence. For each sequence, the first positive integer N (<=1000000) is the size of that sequence. Then N integers follow, separated by a space. It is guaranteed that all the integers are in the range of long int.
Output
For each test case you should output the median of the two given sequences in a line.
Sample Input
4 11 12 13 14
5 9 10 15 16 17
Sample Output
13
解题思路
排序AC代码
#include <cstdio> #include <algorithm> using namespace std; vector<long long> v; int main() { long long n, t; scanf("%lld", &n); while (n--){ scanf("%lld", &t); v.push_back(t); } scanf("%lld", &n); while (n--){ scanf("%lld", &t); v.push_back(t); } nth_element(v.begin(), v.begin() + (v.size() - 1)/2, v.end()); printf("%lld\n", v[(v.size() - 1)/2]); return 0; }
相关文章推荐
- 在命令行用 sort 进行排序
- 文件遍历排序函数
- C#选择排序法实例分析
- C#插入法排序算法实例分析
- C#实现Datatable排序的方法
- SQLSERVER的排序问题结果不是想要的
- Windows Powershell排序和分组管道结果
- C#通过IComparable实现ListT.sort()排序
- C#选择法排序实例分析
- SQL学习笔记四 聚合函数、排序方法
- C#对list列表进行随机排序的方法
- 一根网线内的8根线哪4根是传输数据的,哪四根是防干扰的
- C#折半插入排序算法实现方法
- SQL进行排序、分组、统计的10个新技巧分享
- C++实现位图排序实例
- C语言中快速排序和插入排序优化的实现
- 基于C++实现的各种内部排序算法汇总
- C++线性时间的排序算法分析
- SQL行号排序和分页(SQL查询中插入行号 自定义分页的另类实现)
- PHP下对数组进行排序的函数