2016 UESTC Training for Data Structures D - 卿学姐与魔法 CDOJ 1329 堆
D题:卿学姐与魔法就是有两个长度为N的序列A和B,N
#include
#include
#include
#include
usingnamespacestd;
#definelllonglong
#definemaxn100005
intN,a[maxn],b[maxn],ans[maxn];
structNode
{
intnum,ai,bi;
Node(){}
Node(intn,inta