欢迎访问 生活随笔!

生活随笔

当前位置: 首页 > 编程资源 > 编程问答 >内容正文

编程问答

九度OnlineJudge之1004:Median

发布时间:2025/3/14 编程问答 37 豆豆
生活随笔 收集整理的这篇文章主要介绍了 九度OnlineJudge之1004:Median 小编觉得挺不错的,现在分享给大家,帮大家做个参考.
题目描述:

    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 non-decreasing 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.

输入:

    Each input file may contain more than 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.

输出:

    For each test case you should output the median of the two given sequences in a line.

样例输入:
4 11 12 13 14 5 9 10 15 16 17
样例输出:           13#include <iostream> #include <vector> #include <algorithm> using namespace std;int main() { vector<long> vec;int size1=0,size2=0; long t=0; while(cin>>size1) {int n1=size1;vec.clear();while(n1--){cin>>t;vec.push_back(t);}cin>>size2;int n2 =size2;while(n2--){cin>>t;vec.push_back(t);}sort(vec.begin(),vec.end());int s=size1+size2; if(s%2) cout<<*(vec.begin()+s/2)<<endl; else cout<<*(vec.begin()+s/2-1)<<endl;}//system("pause");return 0; }

转载于:https://www.cnblogs.com/ainima/p/6331260.html

总结

以上是生活随笔为你收集整理的九度OnlineJudge之1004:Median的全部内容,希望文章能够帮你解决所遇到的问题。

如果觉得生活随笔网站内容还不错,欢迎将生活随笔推荐给好友。