P1631 序列合并

3
2 6 6
1 4 8

3 6 7

需要注意一下
priority_queue比heap慢
make_heap比pop_heap慢

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<cmath>
 5 #include<queue>
 6 #include<algorithm>
 7 using namespace std;
 8 const int MAXN=1000001;
 9 priority_queue<int>q;
10 void read(int & n)
11 {
12     char c='+';int x=0;int flag=0;
13     while(c<'0'||c>'9')
14     {
15         c=getchar();
16         if(c=='-')flag=1;
17     }
18     
19     while(c>='0'&&c<='9')
20         x=x*10+c-48,c=getchar();
21     if(flag==1)n=-x;
22     else n=x;
23 }
24 int n,tot;
25 int a[MAXN],b[MAXN],c[MAXN];
26 int main()
27 {
28     read(n);
29     for(int i=1;i<=n;i++)
30     read(a[i]);
31     for(int i=1;i<=n;i++)
32     read(b[i]);
33     for(int i=1;i<=n;i++)
34         c[i]=a[1]+b[i];
35     make_heap(c+1,c+n+1);
36     for(int i=2;i<=n;i++)
37     {
38         for(int j=1;j<=n;j++)
39         {
40             if(a[i]+b[j]<c[1])
41             {
42                 //q.push(a[i]+b[j]);
43                 c[1]=a[i]+b[j];
44                 pop_heap(c+1,c+n+1);
45             }
46             else break;
47         }
48     }
49     //priority_queue<int,vector<int>,greater<int> >p;
50     make_heap(c+1,c+n+1,greater<int>());
51     int k=n;
52     for(int i=1;i<=n;i++)
53     {
54         printf("%d ",c[1]);
55         pop_heap(c+1,c+1+k,greater<int>());
56         k--;
57     }
58     return 0;
59 }