1029. Median (25)
2015-11-06 16:21
363 查看
主题如以下:
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
Sample Output
题目很easy。仅仅须要输出两个集合并集的中位数(索引取下整),我的解决的方法是把全部元素压入vector,然后调用sort函数得到非降序,(vector容量-1)/2 这个索引相应的就是要找的中位数。
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
题目很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; }
相关文章推荐
- Android插件—Android Drawable Importer
- [Android基础]Intent
- java项目分层思想
- 图像识别中的深度学习【香港中文大学王晓刚】
- 多线性主成分分析(MPCA)简介
- 如何查看电脑的配置-卖电脑必备(尤其二手)
- hibernate的Transaction接口理解
- Oracle数据远程连接的四种设置方法和注意事项
- CPU中的缓存和操作系统中的缓存分别是什么 ?
- php 配置苦难
- java记——玩转阶乘
- libevent代码阅读(8)——“hello-world.c”之 创建监听器
- Dubbo阿里Alibaba开源的分布式服务框架
- stringBuffer拼接有规律字符串
- Google Chrome浏览器中如何使用命令
- PLSQLDeveloper连接远程Oracle数据库
- [AHK]倒计时牌(高考还有多少天这类的)
- 31天重构学习笔记(java版本)
- angular-file-upload API angular文件上传插件
- mysql5.7.9 源码安装