cdoj 1329 卿学姐与魔法 优先队列

卿学姐与魔法

Input

Output

Sample input and output

5
1 3 2 4 5
6 3 4 1 7

2
3
4
4
5

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define esp 0.00000000001
const int N=2e5+10,M=1e6+10,inf=1e9;
int a
;
int b
;
struct is
{
int s,x;
int num;
bool friend operator <(is a,is b)
{
return a.num>b.num;
}
};
int main()
{
int x,y,z,i,t;
while(~scanf("%d",&x))
{
priority_queue<is>q;
for(i=1;i<=x;i++)
scanf("%d",&a[i]);
sort(a+1,a+x+1);
for(i=1;i<=x;i++)
scanf("%d",&b[i]);
sort(b+1,b+x+1);
for(i=1;i<x;i++)
{
is s;
s.s=i;
s.x=1;
s.num=a[i]+b[1];
q.push(s);
}
int ji=1;
while(!q.empty()&&ji<=x)
{
is v=q.top();
q.pop();
printf("%d\n",v.num);
ji++;
is l;
l.s=v.s;
l.x=v.x+1;
l.num=a[l.s]+b[l.x];
if(l.x<=x)
q.push(l);
}
}
return 0;
}