You are given arr, an array of integers, n, the size of the array, and a number k. The arguments are passed in the order: n, arr. k. Your task is to write the function findMinMaxSums which computes the maximum and minimum possible sums of the elements in the array after having discarded exactly k elements. Return these numbers in an array: [max, min]. You should not use any sorting library functions. • Note: k

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
You are given arr, an array of integers, n, the size of the array, and a number k. The arguments are
passed in the order: n, arr. k.
Your task is to write the function findMinMaxSums which computes the maximum and minimum
possible sums of the elements in the array after having discarded exactly k elements. Return these
numbers in an array: [max, min].
You should not use any sorting library functions.
• Note: k<n
.
Example 1
Input:
• n = 5
• arr=12345
.
• k=1
.
Output:
• 14 10
Explanation:
• The maximum possible sum after discarding one number is equal to 2+3+4+5 = 14, after
discarding number 1. The minimum possible sum after discarding one number is equal to
1+2+3+4=10, after discarding number 5.
Example 2
Input:
• n=3
.
• arr=567
• k=2
.
Output:
75
Coding Window C++
1 #include <iostream>
2 #include <vector>
3 #include <algorithm>
4
5 std::vector<int> findMin
6
// write your code he
7
8
9
10
11
12
13
14
15
16
17
18
Tests
}
int main() {
int n, k;
std::cin>> n;
std::vectorcint> arra
for (int i = 0; i <
std::cin >> arr[
}
Example 1
Example 2
Example 3
+ Add Test Case (0/6)
t
Transcribed Image Text:You are given arr, an array of integers, n, the size of the array, and a number k. The arguments are passed in the order: n, arr. k. Your task is to write the function findMinMaxSums which computes the maximum and minimum possible sums of the elements in the array after having discarded exactly k elements. Return these numbers in an array: [max, min]. You should not use any sorting library functions. • Note: k<n . Example 1 Input: • n = 5 • arr=12345 . • k=1 . Output: • 14 10 Explanation: • The maximum possible sum after discarding one number is equal to 2+3+4+5 = 14, after discarding number 1. The minimum possible sum after discarding one number is equal to 1+2+3+4=10, after discarding number 5. Example 2 Input: • n=3 . • arr=567 • k=2 . Output: 75 Coding Window C++ 1 #include <iostream> 2 #include <vector> 3 #include <algorithm> 4 5 std::vector<int> findMin 6 // write your code he 7 8 9 10 11 12 13 14 15 16 17 18 Tests } int main() { int n, k; std::cin>> n; std::vectorcint> arra for (int i = 0; i < std::cin >> arr[ } Example 1 Example 2 Example 3 + Add Test Case (0/6) t
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Arrays
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education