题目1004：Median

最新推荐文章于 2022-03-02 15:39:38 发布

原创最新推荐文章于 2022-03-02 15:39:38 发布 · 202 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#水题 #cpp

WangOJ 专栏收录该内容

11 篇文章

订阅专栏

本文介绍了一种求解两个已排序整数序列中位数的算法，通过合并两个序列并排序来找到中位数，提供了完整的C++实现代码。

题目1004：Median

时间限制：1 秒

内存限制：32 兆

特殊判题：否

提交：20282

解决：5663

读懂题。。。。英语渣。。。。 题目描述：

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

样例输出：

来源：

2011年浙江大学计算机及软件工程研究生机试真题

#include <stdio.h>
#include <iostream>
#include <stack>
#include <string.h>
#include <queue>
#include <cmath>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <string>
using namespace std;
typedef long long LL;
int ans[1000000];
 
int main() {
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    int t1, t2;
    while(scanf("%d", &t1) != EOF) {
        vector<int> v1;
        for(int i = 0; i < t1; i++){
            int temp;
            cin >> temp;
            v1.push_back(temp);
        }
        cin >> t2;
        for(int i = 0; i < t2; i++){
            int temp;
            cin >> temp;
            v1.push_back(temp);
        }
        sort(v1.begin(), v1.end());
        if(v1.size() % 2 == 0){
            cout << v1[v1.size() / 2 - 1] << endl;
        }else {
            cout << v1[v1.size() / 2] << endl;
        }
    }
 
 
 
    return 0;
}
 
 
/**************************************************************
    Problem: 1004
    User: Crazy_man
    Language: C++
    Result: Accepted
    Time:10 ms
    Memory:5424 kb
****************************************************************/