【PAT甲级】1029. Median (25)

来源：互联网发布：还珠格格天上人间知画编辑：程序博客网时间：2024/05/15 12:10

#include <stdio.h>#include <algorithm>#include <deque>using namespace std;deque<long> dq[2];deque<long> q;int main(int argc, char *argv[]) {    for (int i = 0; i < 2; i++) {        int m;        scanf("%d", &m);        for (int j = 0; j < m; j++) {            long n;            scanf("%ld", &n);            dq[i].push_back(n);        }    }    while (!dq[0].empty() || !dq[1].empty()) {        if (dq[0].empty()) {            q.push_back(dq[1].front());            dq[1].pop_front();        } else if (dq[1].empty()) {            q.push_back(dq[0].front());            dq[0].pop_front();        } else {            if (dq[0].front() < dq[1].front()) {                q.push_back(dq[0].front());                dq[0].pop_front();            } else if (dq[0].front() > dq[1].front()) {                q.push_back(dq[1].front());                dq[1].pop_front();            } else {                q.push_back(dq[0].front());                dq[0].pop_front();                dq[1].pop_front();            }        }    }    printf("%ld\n", q[(q.size() - 1) / 2]);    return 0;}

0 0