-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLOWSUM.cpp
More file actions
41 lines (39 loc) · 921 Bytes
/
Copy pathLOWSUM.cpp
File metadata and controls
41 lines (39 loc) · 921 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
#define lli long long int
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t, k, q;
cin>>t;
while(t--){
cin>>k>>q;
vector<lli> A(k), B(k), V;
priority_queue<lli> pq;
for(int i=0;i<k;i++) cin>>A[i];
for(int i=0;i<k;i++) cin>>B[i];
sort(A.begin(), A.end());
sort(B.begin(), B.end());
for(int i=0;i<k;i++)
for(int j=0;j<k;j++){
if(pq.size()<=10000) pq.push(A[i]+B[j]);
else if(A[i]+B[j]<pq.top()){
pq.pop();
pq.push(A[i]+B[j]);
}
else break;
}
while(!pq.empty()){
V.push_back(pq.top());
pq.pop();
}
while(q--){
cin>>k;
cout<<V[V.size()-k]<<"\n";
}
}
return 0;
}