Question task1 Write a function: solution.cp test-input.t- int solution (vector<int> &A, int k); that, given an array A of N positive integers and positive integer K, returns the largest even sum of K elements. If there are no such k elements, return -1. Examples: 1. Given A = [4, 9, 8, 2, 6] and K = 3, the function should return 18, as explained above. 2. Given A = [5, 6, 3, 4, 2) and K = 5, the function should return 20. There are five elements and they sum to 20. 3. Given A = [7,7,7,7,7] and K = 1, the function should return -1, as we can pick only one element and there are no even ones. 4. Given A = [10000) and K = 2, the function should return -1 because K is larger than N. 5. Given A = [2,3,3,5, 5), K = 3, the function should return 12, because 5+5+ 2 = 12. Test Output Write an efficient algorithm for the following assumptions: • N and K are integers within the range [1..100,000); • each element of array A is an integer within the range [1..10,000). -- Copyright 2009-2021 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited. REDMI NOTE 8 Autocomplete is connected 1 All changes saved AI QUAD CAMERA o Type here to search

EM06ZV The Asker · Computer Science

Transcribed Image Text: task1 Write a function: solution.cp test-input.t- int solution (vector &A, int k); that, given an array A of N positive integers and positive integer K, returns the largest even sum of K elements. If there are no such k elements, return -1. Examples: 1. Given A = [4, 9, 8, 2, 6] and K = 3, the function should return 18, as explained above. 2. Given A = [5, 6, 3, 4, 2) and K = 5, the function should return 20. There are five elements and they sum to 20. 3. Given A = [7,7,7,7,7] and K = 1, the function should return -1, as we can pick only one element and there are no even ones. 4. Given A = [10000) and K = 2, the function should return -1 because K is larger than N. 5. Given A = [2,3,3,5, 5), K = 3, the function should return 12, because 5+5+ 2 = 12. Test Output Write an efficient algorithm for the following assumptions: • N and K are integers within the range [1..100,000); • each element of array A is an integer within the range [1..10,000). -- Copyright 2009-2021 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited. REDMI NOTE 8 Autocomplete is connected 1 All changes saved AI QUAD CAMERA o Type here to search

More

Community Answer

Honor Code

Solved 1 Answer

Code : #include <bits/stdc++.h> #include <iostream> using namespace std; int evenSumK(vector<int> arr, int N, int K) { if (K > N) return -1; int maxSum = 0; //make vector to stote even and odd number vector<int> Even; vector<int> Odd; //iterate all element and seprate each number in even and odd vector for(int i : arr) if (i % 2) Odd.push_back(i); else Even.push_back(i); //sort both even and odd vector sort(Odd.begin(), Odd.end()); sort(Even.begin(), Even.end()); //intialize index of last element from both list int i = Even.size() - 1; int j = Odd.size() - 1; //iterate while loop k times while (K > 0) { //check if k is odd or even if (K % 2 == 1) { if (i >= 0) { maxSum += Even[i]; i--; } else { return -1; } //decrement k by 1 K--; } //check that i and j is greater than or equal to 1 else if (i >= 1 && j >= 1) { if (Even[i] + Even[i - 1] <= Odd[j] + Odd[j - 1]) { maxSum += Odd[j] + Odd[j - 1]; j -= 2; } else { maxSum += Even[i] + Even[i - 1]; i -= 2; } //decrement k by 2 because here we added two number K -= 2; } else if (i >= 1) { //note : sum of two even number is also even so add it to maxSum maxSum += Even[i] + Even[i - 1]; i -= 2; K -= 2; } else if (j >= 1) { //note : sum of two odd number is always even so add it to maxSum maxSum += Odd[j] + Odd[j - 1]; j -= 2; K -= 2; } } //return maxSum return maxSum; } int main() { vector<int> A; A.push_back(4); A.push_back(9); A.push_back(8); A.push_back(2); A.push_back(6); int N = A.size(); int K = 3; cout << "Even sum : " << evenSumK(A, N, K) << endl; } Output : Even sum : 18 ...   ...