//#include <bits/stdc++.h>
#include<algorithm>
#include<iostream>
#include<algorithm>
#include<queue>
#include<stdio.h>
#include<string.h>
using namespace std;
const int maxn=100001;
int a[maxn];
int b[maxn];
int n;
struct st
{
int y,num;
bool operator <(const st &v)const
{
return num>v.num;
}
};
st k;
priority_queue<st>q;
int main()
{
cin>>n;
for(int i=1; i<=n; i++)
{
cin>>a[i];
}
for(int i=1; i<=n; i++)
cin>>b[i];
sort(a+1,a+n+1);
sort(b+1,b+n+1);
for(int i=1; i<=n; i++)
{
k.y=1;
k.num=a[i]+b[1];
q.push(k);
}
int s=1;
while(s<=n)
{
st now=q.top();
q.pop();
if(now.y+1<=n)
{
k.y=now.y+1;
k.num=now.num-b[now.y]+b[now.y+1];
q.push(k);
}
s++;
cout<<now.num;
if(s<=n)
cout<<" ";
}
return 0;
}
n 个最小和
猜你喜欢
转载自blog.csdn.net/chen_zan_yu_/article/details/105424661
今日推荐
周排行