-
Notifications
You must be signed in to change notification settings - Fork 0
/
LOWSUM.cpp
68 lines (62 loc) · 1.12 KB
/
LOWSUM.cpp
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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
void swap(int data[], int i, int j)
{
int tmp = data[i];
data[i] = data[j];
data[j] = tmp;
}
int Partition(int data[], int low, int high);
void QuickSort(int data[], int low, int high)
{
if (low >= high) return;
int p = Partition(data, low, high);
QuickSort(data, low, p-1);
QuickSort(data, p+1, high);
}
int Partition(int data[], int low, int high)
{
int p = low;
for (int i = p+1; i <= high; ++i)
{
if (data[i] < data[p])
{
swap(data, i, p);
if (i != p+1)
{
swap(data, i, p+1);
}
p = p + 1;
}
}
return p;
}
int main()
{ int t;
cin>>t;
while(t--)
{
int K,Q;
cin>>K>>Q;
ll k[k],q[K];
for(int i=0;i<K;i++)
cin>>k[i];
for(int i=0;i<K;i++)
cin>>q[i];
int l=0;
QuickSort(k,0,K-1);
QuickSort(q,0,K-1);
for(int i=0;i<K;i++)
for(int j=0;j<K;j++)
arr[l++]=k[i]+q[j];
QuickSort(arr,0,l-1);
for(int i=0;i<Q;i++)
{int x;
cin>>x;
cout<<arr[x]<<endl;
}
}
return 0;
}