Running Median

最新推荐文章于 2022-02-17 15:51:14 发布

SSL_Yyx

最新推荐文章于 2022-02-17 15:51:14 发布

阅读量300

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/SSL_Yyx/article/details/81772198

本文介绍了一个程序设计问题：如何在读取一系列32位有符号整数的过程中，每读取一个奇数位置的数值就输出已接收数值的中位数。该文通过示例输入输出展示了程序的具体运作方式，并提供了完整的C++代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description

For this problem, you will write a program that reads in a sequence of 32-bit signed integers. After each odd-indexed value is read, output the median (middle value) of the elements received so far.

Input

The first line of input contains a single integer P, (1 ≤ P ≤ 1000), which is the number of data sets that follow. The first line of each data set contains the data set number, followed by a space, followed by an odd decimal integer M, (1 ≤ M ≤ 9999), giving the total number of signed integers to be processed. The remaining line(s) in the dataset consists of the values, 10 per line, separated by a single space. The last line in the dataset may contain less than 10 values.

Output

For each data set the first line of output contains the data set number, a single space and the number of medians output (which should be one-half the number of input values plus one). The output medians will be on the following lines, 10 per line separated by a single space. The last line may have less than 10 elements, but at least 1 element. There should be no blank lines in the output.

Sample Input

3
1 9
1 2 3 4 5 6 7 8 9
2 9
9 8 7 6 5 4 3 2 1
3 23
23 41 13 22 -3 24 -31 -11 -8 -7
3 5 103 211 -311 -45 -67 -73 -81 -99
-33 24 56

Sample Output

1 5
1 2 3 4 5
2 5
9 8 7 6 5
3 12
23 23 22 22 13 3 5 5 3 -3
-7 -3

程序

#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<iostream>
using namespace std;

int n,t,x,a,b,cnt;

inline void read(int &x){
    char ch=getchar();
    char c=ch;
    x=0;
    while(ch<'0' || ch>'9') {
        c=ch;
        ch=getchar();
    }
    while(ch>='0' && ch<='9'){
        x=(x<<1)+(x<<3)+ch-'0';
        ch=getchar();
    }
    if(c== '-') x=-x;
}

std::priority_queue <int> lq,sq;


int main(){
    read(t);
    while(t--){
        read(cnt);
        read(n);
        while(!lq.empty())  lq.pop();
        while(!sq.empty())  sq.pop();
        cout<<cnt<<' '<<((n+1)/2)<<endl;
        for(int i = 1;i <= n;++ i){
            read(x);
            lq.push(x);
            sq.push(-x);
            if(i%2==0) continue;
            while(lq.top()!=-sq.top()){
                a=lq.top();
                lq.pop();
                b=-sq.top();
                sq.pop();
                sq.push(-a);
                lq.push(b);
            }
            cout<<lq.top()<<' ';
            if(((i+1)/2)%10==0) puts("");
                else if((n%2==1 && i==n) || (n%2==0 && i==n-1)) puts("");
        }    
    }
    return 0;
}