zoukankan      html  css  js  c++  java
  • PAT Advanced 1029 Median (25分)

    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 Specification:

    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 (≤) 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 Specification:

    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>
    using namespace std;
    int arr[1000000] = {0}, arr2[1000000] = {0}, arr3[1000000] = {0};
    int main() {
        int M, N;
        scanf("%d", &M);
        for(int i = 0; i < M; i++)
            scanf("%d", arr+i);
        scanf("%d", &N);
        for(int i = 0; i < N; i++)
            scanf("%d", arr2+i);
        int i = 0, j = 0, k = 0;
        while(i < M && j < N) {
            if(arr[i] < arr2[j]) arr3[k++] = arr[i++];
            else arr3[k++] = arr2[j++];
            if(k == (M + N + 1) / 2)
                 printf("%d
    ", arr3[k - 1]);
        }
        while(i < M) {
            arr3[k++] = arr[i++];
            if(k == (M + N + 1) / 2)
                 printf("%d
    ", arr3[k - 1]);
        }
        while(j < N) {
            arr3[k++] = arr2[j++];
            if(k == (M + N + 1) / 2)
                 printf("%d
    ", arr3[k - 1]);
        }
        return 0;
    }
  • 相关阅读:
    vue-cli3安装使用
    document.readyState
    js的堆与栈
    常用方法
    js常见排序算法
    微信小程序swiper高度问题
    微信小程序滑动菜单
    数据筛选和排序------的解析
    使用Windows实现数据绑定----------的解析
    实现Windoes程序的数据更新------的详细解析
  • 原文地址:https://www.cnblogs.com/littlepage/p/12248657.html
Copyright © 2011-2022 走看看