zoukankan      html  css  js  c++  java
  • pat 1029. Median (25)

    1029. Median (25)

    时间限制
    400 ms
    内存限制
    65536 kB
    代码长度限制
    16000 B
    判题程序
    Standard
    作者
    CHEN, Yue

    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
    解:排序,输出中间下标对应的值。

    代码:

    #include<iostream>
    #include<cstdio>
    #include<cstdlib>
    #include<algorithm>
    using namespace std;
    typedef long long ll;
    ll a[2000000+1];
    int main()
    {
        int n,m,cnt=0;
        scanf("%d",&n);
        for(int i=0;i<n;i++)
            scanf("%lld",&a[cnt++]);
        scanf("%d",&m);
        for(int i=0;i<m;i++)
            scanf("%lld",&a[cnt++]);
        sort(a,a+cnt);
        printf("%lld
    ",a[(n+m-1)/2]);
        return 0;
    }
    

    版权声明:本文为博主原创文章,未经博主允许不得转载。

  • 相关阅读:
    无题
    Tomcat如何配置环境变量
    linux 下 jdk+tomcat+mysql 的 jsp 环境搭建
    when you're gone
    sublime text3插件篇
    java如何从cmd运行并使用text文件作为输入源的总结
    在发送intent启动activity之前判断是否有activity接收
    contentvalue的探究(结构,用途)
    JAVA input/output 流层次关系图
    activity状态保存的bundl对象存放位置的思考
  • 原文地址:https://www.cnblogs.com/Tobyuyu/p/4965287.html
Copyright © 2011-2022 走看看