Code-Vault/Practice.cpp at main · Ritik-0102/Code-Vault · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
// K Maximum sum combination from two arrays

// Given two arrays A and B of size n, find the k maximum sum combinations where each combination is formed by selecting one element from A and one from B

// A = {4, 2, 5, 1};
// B = {4, 2, 5, 1};
// K = 3

// Possible sums :
// 5+8 = 13
// 4+8 = 12
// 5+5 = 10

// output : 13 12 10

#include<iostream>
#include<vector>

using namespace std;

int main(){
    vector<int> arr1 = {};
}