1029. Median (25)
主题如以下:
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 Input4 11 12 13 14 5 9 10 15 16 17Sample Output
13
题目很easy。仅仅须要输出两个集合并集的中位数(索引取下整),我的解决的方法是把全部元素压入vector,然后调用sort函数得到非降序,(vector容量-1)/2 这个索引相应的就是要找的中位数。
#include <iostream> #include <vector> #include <algorithm> #include <stdio.h> using namespace std; int main() { vector<long int> setA; int N; cin >> N; long int value; for(int i = 0; i < N; i++){ scanf("%ld",&value); setA.push_back(value); } cin >> N; for(int i = 0; i < N; i++){ scanf("%ld",&value); setA.push_back(value); } sort(setA.begin(),setA.end()); cout << setA[(setA.size() - 1)/2] << endl; return 0; }
版权声明:本文博主原创文章。博客,未经同意不得转载。
相关文章
- Canonical 开源 MicroK8 | 云原生生态周报 Vol. 25
- [SAA + SAP] 25. VPC - 1
- Python 刷Leetcode题库,顺带学英语单词(25)
- 【第3版emWin教程】第25章 emWin6.x的JPEG图片显示(硬件解码)
- RTX5教程官方版本正式发布,针对CMSIS-RTOS V2封装层,也适合FreeRTOS使用(2020-03-25)
- 25. 使用自开发的代理服务器解决 SAP UI5 应用访问远端 OData 服务的跨域问题
- Account detail页面加载的性能分析 - 2017-09-25
- 【LeetCode 25】K 个一组翻转链表
- 说说 PADS Layout 中的第 20 层和 第 25层
- 记:《洛克菲勒留给儿子的38封信》-- 25
- 回顾“90后”——MISRA的25年岁月