1029. Median (25)
2015-06-05 16:00
239 查看
题目如下:
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
题目非常简单,只需要输出两个集合并集的中位数(索引取下整),我的解决办法是把所有元素压入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
题目非常简单,只需要输出两个集合并集的中位数(索引取下整),我的解决办法是把所有元素压入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; }
相关文章推荐
- SCORM Content Packages - Trident
- 【OpenCV入门教程之一】 安装OpenCV:OpenCV 3.0、OpenCV 2.4.8、OpenCV 2.4.9 +VS 开发环境配置
- 设计模式-外观模式
- jquery下拉框事件
- 关于龙卷风你应该知道的五件事
- cv::imread的flags
- SAT句子填空题的分析过程
- 实践出真知系列
- robotframework 是如何根据output收集失败的case的
- 二进制权限控制
- linux常用命令之login命令
- c++设计模式之外观模式
- iOS 线程库 promisekit
- Spark MLlib Deep Learning Deep Belief Network (深度学习-深度信念网络)2.2
- Android 网格视图GridView的使用
- Codeforces 107B Basketball Team 简单概率
- iOS archiveRootObject 归档失败问题
- 【Java23种设计模式学习笔记】一:策略模式
- C语言实现缓冲区溢出实例
- 寄存器