ACwing 146. 序列

#include
#include
#include
#include

using namespace std;

const int N=2010;
int a[N],b[N],c[N];
int m,n;
typedef pair pii;

void merge()
{
  
  priority_queue,greater>heap;//创建最小根堆
  for(int i=0;i>T;
  while(T--)
  {
    cin>>m>>n;
    //scanf("%d%d",&m,&n);
    for(int i=0;i>a[i];//scanf("%d",&a[i]);
    sort(a,a+n);
    for(int i=0;i>b[j];//scanf("%d",&b[j]);
      merge();
    }
    for(int i=0;i