[R语言] HDU 3282 Running Median 动态中位数，可惜数据范围太小

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

//qscqesze
#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <typeinfo>
#include <fstream>
#include <map>
typedef long long ll;
using namespace std;
//freopen("D.in","r",stdin);
//freopen("D.out","w",stdout);
#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
#define maxn 100005
#define mod 10007
#define eps 1e-9
//const int inf=0x7fffffff;   //无限大
const int inf=0x3f3f3f3f;
/*
*/
//**************************************************************************************
inline ll read()
{
  int x=0,f=1;char ch=getchar();
  while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
  while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
  return x*f;
}
struct node
{
  int x,y;
};
node a[maxn];
bool cmp(node b,node c)
{
  return b.x<c.x;
}
int main()
{
  int t=read();
  for(int cas=1;cas<=t;cas++)
  {
    vector<int> ans;
    int n=read(),m=read();
    for(int i=0;i<m;i++)
      a[i].x=read(),a[i].y=i+1;
    sort(a,a+m,cmp);
    for(int i=0;i<m;i+=2)
    {
      int flag=0;
      for(int j=0;j<m;j++)
      {
        if(a[j].y<=i+1)
          flag++;
        if(flag==(i+2)/2)
        {
          ans.push_back(a[j].x);
          break;
        }
      }
    }
    printf("%d %d",cas,ans.size());
    for(int i=0;i<ans.size();i++)
    {
      if((i)%10==0)
        printf("\n");
      if(i%10==0)
        printf("%d",ans[i]);
      else
        printf(" %d",ans[i]);
    }
    printf("\n");
  }
}