#include <stdio.h>
#include <queue>
#include <stack>
using namespace std;
vector<int>QT;
priority_queue<int,vector<int>,greater<int> >Q;
int main()
{
int n,m;
scanf("%d%d",&n,&m);
while (n--)
{
int x;
scanf("%d",&x);
Q.push(x);
}
while (QT.empty()==false)
{
QT.pop_back();
}
while (m--)
{
int x;
scanf("%d",&x);
while (x>=Q.top()&&Q.empty()==false)
{
if (x!=Q.top())
{
QT.push_back(Q.top(......
阅读全文