zoukankan      html  css  js  c++  java
  • 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

     1 #include<stdio.h>
     2 #include<vector>
     3 using namespace std;
     4 
     5 #define MAX ((1<<31)-1)
     6 int main()
     7 {
     8     
     9     int n1,n2,i,j,tem;
    10     while(scanf("%d",&n1)!=EOF)
    11     {
    12         vector<long long> v1,v2;
    13         for(i = 0;i<n1;i++)
    14         {
    15             scanf("%d",&tem);
    16             v1.push_back(tem);
    17         }
    18         v1.push_back(MAX);     //可以防止移动到 空数组
    19         getchar();
    20         scanf("%d",&n2);
    21         for(i = 0;i<n2;i++)
    22         {
    23             scanf("%d",&tem);
    24             v2.push_back(tem);
    25         }
    26         v2.push_back(MAX);
    27         int mid = (n1 + n2 +1 )/2;
    28         int index;
    29         i = 0;
    30         j = 0;
    31 
    32         while(mid > 0)
    33         {
    34             if(v1[i] < v2[j] )
    35             {
    36                 index = 1;
    37                 ++i;
    38                 --mid;
    39             }
    40             else
    41             {
    42                 index = 2;
    43                 ++j;
    44                 --mid;
    45             }
    46         }
    47 
    48         if(index == 1)
    49             printf("%d
    ",v1[i-1]);
    50         else
    51         {
    52             printf("%d
    ",v2[j-1]);
    53         }
    54         
    55     }
    56     return 0;
    57 }
  • 相关阅读:
    【Alpha】测试报告
    【Alpha】发布说明
    【Alpha】项目展示
    【Alpha】Scrum Meeting 10
    【Alpha】Scrum Meeting 9
    【Alpha】Scrum Meeting 8
    “北航Clubs”功能规格说明书
    后端技术规格说明书
    前端设计说明书
    Daily Scrumming* 2015.11.3(Day 15)
  • 原文地址:https://www.cnblogs.com/xiaoyesoso/p/4276374.html
Copyright © 2011-2022 走看看