From 721377cf67ff11a64d4f2a2c03ab2ca1c6853c06 Mon Sep 17 00:00:00 2001
From: Akash Goyal <aakash.g@hotmail.com>
Date: Sat, 13 Oct 2018 13:06:44 +0530
Subject: [PATCH] Added Max_Pair_Sum

---
 Max_Pair_Sum.cpp | 51 ++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 51 insertions(+)
 create mode 100644 Max_Pair_Sum.cpp

diff --git a/Max_Pair_Sum.cpp b/Max_Pair_Sum.cpp
new file mode 100644
index 0000000..890535e
--- /dev/null
+++ b/Max_Pair_Sum.cpp
@@ -0,0 +1,51 @@
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+typedef pair<ll,ll> pr;
+typedef vector<pr> vp;
+typedef vector<vp> vpp;
+typedef vector<vector<ll> > graph;
+#define pb push_back
+#define mp make_pair
+#define maxi INT_MAX
+#define mini INT_MIN
+ll mod = pow(10,9) + 7;
+
+int main()
+{
+    ll t;
+    cin>>t;
+    while(t--)
+    {
+        ll n,k;
+        cin>>n>>k;
+        ll a[n], b[n];
+        for(int i=0;i<n;i++) cin>>a[i];
+        for(int i=0;i<n;i++) cin>>b[i];
+        sort(a,a+n);
+        sort(b,b+n);
+        ll pos[n];
+        for(int i=0;i<n;i++)
+        pos[i]=n-1;
+        priority_queue<pr> pq;
+        for(int i=0;i<n;i++)
+        {
+            pq.push(mp(a[i]+b[n-1], i));
+        }
+        while(k--)
+        {
+            ll temp = pq.top().first;
+            ll index = pq.top().second;
+            pq.pop();
+            if(pos[index]>0)
+            {
+                pos[index]--;
+                pq.push(mp(a[index]+b[pos[index]],index));
+            }
+            cout<<temp<<" ";
+        }
+        cout<<endl;
+    }
+    
+    
+}
\ No newline at end of file