Minimum sum of product of two arrays
Last Updated : 14 Jul, 2023
Find the minimum sum of Products of two arrays of the same size, given that k modifications are allowed on the first array. In each modification, one array element of the first array can either be increased or decreased by 2.
Examples:
Input : a[] = {1, 2, -3} b[] = {-2, 3, -5} k = 5 Output : -31 Explanation: Here n = 3 and k = 5. So, we modified a[2], which is -3 and increased it by 10 (as 5 modifications are allowed). Final sum will be : (1 * -2) + (2 * 3) + (7 * -5) -2 + 6 - 35 -31 (which is the minimum sum of the array with given conditions) Input : a[] = {2, 3, 4, 5, 4} b[] = {3, 4, 2, 3, 2} k = 3 Output : 25 Explanation: Here, total numbers are 5 and total modifications allowed are 3. So, modify a[1], which is 3 and decreased it by 6 (as 3 modifications are allowed). Final sum will be : (2 * 3) + (-3 * 4) + (4 * 2) + (5 * 3) + (4 * 2) 6 – 12 + 8 + 15 + 8 25 (which is the minimum sum of the array with given conditions) Since we need to minimize the product sum, we find the maximum product and reduce it. By taking some examples, we observe that making 2*k changes to only one element is enough to get the minimum sum. We will further see why this works but first, let us try to understand the intuition behind doing an increase or decrease of 2*k on any element.
If you want to make the sum of all the products as minimum as possible then thinking greedily we will try to minimize the product at every step possible.
a[] = {1, 2, -3}
b[] = {-2, 3, -5}
At index = 0, the original product is (1*-2) = -2 If we want to decrease it further we would try to increase the value of a[0] in order to increase the -ve magnitude
At index = 1, the original product is (2*3) = 6 here there is only one way to decrease the product which is by decreasing a[1] in order to bring the product to -ve or lesser +ve magnitude.
At index = 2, the original product is (-3*-5) = 15, to decrease the product we need to increase a[2] to make the product -ve
Based on the needs we either increase or decrease an element by 2
Why are we applying 2*k operations on a single element only?
The question might have come to your mind why are we applying 2*k operations (either reducing or increasing) on a single element only, why not apply +2 on some ith index and -4 on some jth index and then -2 on some kth index to find out the minimum product sum. Wouldn't there be a possibility that applying operations on different elements fetch us the optimal answer?
Let us try to understand the same with an example
a[] = {-4, -3, 2, 8, 9}
b[] = {7, -6, 4, 2, -3}
K = 3
Now if I apply 2*k operations on my 0th index of a then a[0] = a[0] - 2*k = -10 so the product = -10*7 = -70
Had it been applied in a different manner such as -2 on the 0th index, +2 on the 1th index, and -2 on the 3th index then array a would be a[] ={-6, -1, 2, 6, 9} and the products at respective indices would be -42, 6, and 12 so our overall reduction = -24 which is less than the case when 2*k operations are being applied on a single element.
Just think in the way that if applying an operation on any element decreases your product then applying the rest of the operation on the same element would further decrease your product and eventually your sum and that's the most optimal way.
I would suggest you write down a few test cases of your own and try applying operations in different ways.
Based on this observation, we consider every element as the element on which we apply all k operations and keep track of the element that reduces the result to a minimum.
C++ // CPP program to find minimum sum of product of two arrays // with k operations allowed on first array. #include <bits/stdc++.h> using namespace std; // Function to find the minimum product int minproduct(int a[], int b[], int n, int k) { int diff = 0, res = 0; int temp; for (int i = 0; i < n; i++) { // Find product of current elements and update // result. int pro = a[i] * b[i]; res = res + pro; // If both product and b[i] are negative, we must // increase value of a[i] to minimize result. if (pro < 0 && b[i] < 0) temp = (a[i] + 2 * k) * b[i]; // If both product and a[i] are negative, we must // decrease value of a[i] to minimize result. else if (pro < 0 && a[i] < 0) temp = (a[i] - 2 * k) * b[i]; // Similar to above two cases for positive product. else if (pro > 0 && a[i] < 0) temp = (a[i] + 2 * k) * b[i]; else if (pro > 0 && a[i] > 0) temp = (a[i] - 2 * k) * b[i]; // Check if current difference becomes higher than // the maximum difference so far. int d = abs(pro - temp); if (d > diff) diff = d; } return res - diff; } // Driver function int main() { int a[] = { 2, 3, 4, 5, 4 }; int b[] = { 3, 4, 2, 3, 2 }; int n = 5, k = 3; cout << minproduct(a, b, n, k) << endl; return 0; } // This code is contributed by Sania Kumari Gupta // C program to find minimum sum of product // of two arrays with k operations allowed on // first array. #include <stdio.h> #include<stdlib.h> // Function to find the minimum product int minproduct(int a[], int b[], int n, int k) { int diff = 0, res = 0; int temp; for (int i = 0; i < n; i++) { // Find product of current elements and update // result. int pro = a[i] * b[i]; res = res + pro; // If both product and b[i] are negative, we must // increase value of a[i] to minimize result. if (pro < 0 && b[i] < 0) temp = (a[i] + 2 * k) * b[i]; // If both product and a[i] are negative, we must // decrease value of a[i] to minimize result. else if (pro < 0 && a[i] < 0) temp = (a[i] - 2 * k) * b[i]; // Similar to above two cases for positive product. else if (pro > 0 && a[i] < 0) temp = (a[i] + 2 * k) * b[i]; else if (pro > 0 && a[i] > 0) temp = (a[i] - 2 * k) * b[i]; // Check if current difference becomes higher than // the maximum difference so far. int d = abs(pro - temp); if (d > diff) diff = d; } return res - diff; } // Driver function int main() { int a[] = { 2, 3, 4, 5, 4 }; int b[] = { 3, 4, 2, 3, 2 }; int n = 5, k = 3; printf("%d ",minproduct(a, b, n, k)); return 0; } // This code is contributed by Sania Kumari Gupta // Java program to find minimum sum of product of two arrays // with k operations allowed on first array. import java.math.*; class GFG { // Function to find the minimum product static int minproduct(int a[], int b[], int n, int k) { int diff = 0, res = 0; int temp = 0; for (int i = 0; i < n; i++) { // Find product of current elements and update // result. int pro = a[i] * b[i]; res = res + pro; // If both product and b[i] are negative, we // must increase value of a[i] to minimize // result. if (pro < 0 && b[i] < 0) temp = (a[i] + 2 * k) * b[i]; // If both product and a[i] are negative, we // must decrease value of a[i] to minimize // result. else if (pro < 0 && a[i] < 0) temp = (a[i] - 2 * k) * b[i]; // Similar to above two cases for positive // product. else if (pro > 0 && a[i] < 0) temp = (a[i] + 2 * k) * b[i]; else if (pro > 0 && a[i] > 0) temp = (a[i] - 2 * k) * b[i]; // Check if current difference becomes higher // than the maximum difference so far. int d = Math.abs(pro - temp); if (d > diff) diff = d; } return res - diff; } // Driver function public static void main(String[] args) { int a[] = { 2, 3, 4, 5, 4 }; int b[] = { 3, 4, 2, 3, 2 }; int n = 5, k = 3; System.out.println(minproduct(a, b, n, k)); } } // This code is contributed by Sania Kumari Gupta # Python program to find # minimum sum of product # of two arrays with k # operations allowed on # first array. # Function to find the minimum product def minproduct(a,b,n,k): diff = 0 res = 0 for i in range(n): # Find product of current # elements and update result. pro = a[i] * b[i] res = res + pro # If both product and # b[i] are negative, # we must increase value # of a[i] to minimize result. if (pro < 0 and b[i] < 0): temp = (a[i] + 2 * k) * b[i] # If both product and # a[i] are negative, # we must decrease value # of a[i] to minimize result. elif (pro < 0 and a[i] < 0): temp = (a[i] - 2 * k) * b[i] # Similar to above two cases # for positive product. elif (pro > 0 and a[i] < 0): temp = (a[i] + 2 * k) * b[i] elif (pro > 0 and a[i] > 0): temp = (a[i] - 2 * k) * b[i] # Check if current difference # becomes higher # than the maximum difference so far. d = abs(pro - temp) if (d > diff): diff = d return res - diff # Driver function a = [ 2, 3, 4, 5, 4 ] b = [ 3, 4, 2, 3, 2 ] n = 5 k = 3 print(minproduct(a, b, n, k)) # This code is contributed # by Azkia Anam.
// C# program to find minimum sum // of product of two arrays with k // operations allowed on first array. using System; class GFG { // Function to find the minimum product static int minproduct(int []a, int []b, int n, int k) { int diff = 0, res = 0; int temp = 0; for (int i = 0; i < n; i++) { // Find product of current elements // and update result. int pro = a[i] * b[i]; res = res + pro; // If both product and b[i] are // negative, we must increase value // of a[i] to minimize result. if (pro < 0 && b[i] < 0) temp = (a[i] + 2 * k) * b[i]; // If both product and a[i] are // negative, we must decrease value // of a[i] to minimize result. else if (pro < 0 && a[i] < 0) temp = (a[i] - 2 * k) * b[i]; // Similar to above two cases // for positive product. else if (pro > 0 && a[i] < 0) temp = (a[i] + 2 * k) * b[i]; else if (pro > 0 && a[i] > 0) temp = (a[i] - 2 * k) * b[i]; // Check if current difference // becomes higher than the maximum // difference so far. int d = Math.Abs(pro - temp); if (d > diff) diff = d; } return res - diff; } // Driver function public static void Main() { int []a = { 2, 3, 4, 5, 4 }; int []b = { 3, 4, 2, 3, 2 }; int n = 5, k = 3; Console.WriteLine(minproduct(a, b, n, k)); } } // This code is contributed by vt_m. <script> // Javascript program to find minimum sum // of product of two arrays with k // operations allowed on first array. // Function to find the minimum product function minproduct(a, b, n, k) { let diff = 0, res = 0; let temp = 0; for (let i = 0; i < n; i++) { // Find product of current elements // and update result. let pro = a[i] * b[i]; res = res + pro; // If both product and b[i] are // negative, we must increase value // of a[i] to minimize result. if (pro < 0 && b[i] < 0) temp = (a[i] + 2 * k) * b[i]; // If both product and a[i] are // negative, we must decrease value // of a[i] to minimize result. else if (pro < 0 && a[i] < 0) temp = (a[i] - 2 * k) * b[i]; // Similar to above two cases // for positive product. else if (pro > 0 && a[i] < 0) temp = (a[i] + 2 * k) * b[i]; else if (pro > 0 && a[i] > 0) temp = (a[i] - 2 * k) * b[i]; // Check if current difference // becomes higher than the maximum // difference so far. let d = Math.abs(pro - temp); if (d > diff) diff = d; } return res - diff; } // Driver code let a = [ 2, 3, 4, 5, 4 ]; let b = [ 3, 4, 2, 3, 2 ]; let n = 5, k = 3; document.write(minproduct(a, b, n, k)); // This code is contributed by sanjoy_62. </script> <?php // PHP program to find minimum sum of product // of two arrays with k operations allowed on // first array. // Function to find the minimum product function minproduct( $a, $b, $n, $k) { $diff = 0; $res = 0; $temp; for ( $i = 0; $i < $n; $i++) { // Find product of current // elements and update // result. $pro = $a[$i] * $b[$i]; $res = $res + $pro; // If both product and b[i] // are negative, we must // increase value of a[i] // to minimize result. if ($pro < 0 and $b[$i] < 0) $temp = ($a[$i] + 2 * $k) * $b[$i]; // If both product and // a[i] are negative, // we must decrease value // of a[i] to minimize // result. else if ($pro < 0 and $a[$i] < 0) $temp = ($a[$i] - 2 * $k) * $b[$i]; // Similar to above two // cases for positive // product. else if ($pro > 0 and $a[$i] < 0) $temp = ($a[$i] + 2 * $k) * $b[$i]; else if ($pro > 0 and $a[$i] > 0) $temp = ($a[$i] - 2 * $k) * $b[$i]; // Check if current difference becomes higher // than the maximum difference so far. $d = abs($pro - $temp); if ($d > $diff) $diff = $d; } return $res - $diff; } // Driver Code $a = array(2, 3, 4, 5, 4 ,0); $b =array(3, 4, 2, 3, 2); $n = 5; $k = 3; echo minproduct($a, $b, $n, $k); // This code is contributed by anuj_67. ?> Output :
25
Time Complexity: O(n)
Auxiliary Space: O(1)
Similar Reads
Greedy Algorithms Greedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Greedy Algorithm Tutorial Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate benefit. Greedy algorithms are used for optimization problems. An optimization problem can be solved using Greedy if the problem has the following pro
9 min read
Greedy Algorithms General Structure A greedy algorithm solves problems by making the best choice at each step. Instead of looking at all possible solutions, it focuses on the option that seems best right now.Example of Greedy Algorithm - Fractional KnapsackProblem structure:Most of the problems where greedy algorithms work follow thes
5 min read
Difference between Greedy Algorithm and Divide and Conquer Algorithm Greedy algorithm and divide and conquer algorithm are two common algorithmic paradigms used to solve problems. The main difference between them lies in their approach to solving problems. Greedy Algorithm:The greedy algorithm is an algorithmic paradigm that follows the problem-solving heuristic of m
3 min read
Greedy Approach vs Dynamic programming Greedy approach and Dynamic programming are two different algorithmic approaches that can be used to solve optimization problems. Here are the main differences between these two approaches: Greedy Approach:The greedy approach makes the best choice at each step with the hope of finding a global optim
2 min read
Comparison among Greedy, Divide and Conquer and Dynamic Programming algorithm Greedy algorithm, divide and conquer algorithm, and dynamic programming algorithm are three common algorithmic paradigms used to solve problems. Here's a comparison among these algorithms:Approach:Greedy algorithm: Makes locally optimal choices at each step with the hope of finding a global optimum.
4 min read
Standard Greedy algorithms
Activity Selection Problem | Greedy Algo-1Given n activities with start times in start[] and finish times in finish[], find the maximum number of activities a single person can perform without overlap. A person can only do one activity at a time. Examples: Input: start[] = [1, 3, 0, 5, 8, 5], finish[] = [2, 4, 6, 7, 9, 9]Output: 4Explanatio
13 min read
Job Sequencing ProblemGiven two arrays: deadline[] and profit[], where the index of deadline[] represents a job ID, and deadline[i] denotes the deadline for that job and profit[i] represents profit of doing ith job. Each job takes exactly one unit of time to complete, and only one job can be scheduled at a time. A job ea
13 min read
Huffman Coding | Greedy Algo-3Huffman coding is a lossless data compression algorithm. The idea is to assign variable-length codes to input characters, lengths of the assigned codes are based on the frequencies of corresponding characters. The variable-length codes assigned to input characters are Prefix Codes, means the codes (
12 min read
Huffman DecodingWe have discussed Huffman Encoding in a previous post. In this post, decoding is discussed. Examples: Input Data: AAAAAABCCCCCCDDEEEEEFrequencies: A: 6, B: 1, C: 6, D: 2, E: 5 Encoded Data: 0000000000001100101010101011111111010101010 Huffman Tree: '#' is the special character usedfor internal nodes
15 min read
Water Connection ProblemYou are given n houses in a colony, numbered from 1 to n, and p pipes connecting these houses. Each house has at most one outgoing pipe and at most one incoming pipe. Your goal is to install tanks and taps efficiently.A tank is installed at a house that has one outgoing pipe but no incoming pipe.A t
8 min read
Greedy Algorithm for Egyptian FractionEvery positive fraction can be represented as sum of unique unit fractions. A fraction is unit fraction if numerator is 1 and denominator is a positive integer, for example 1/3 is a unit fraction. Such a representation is called Egyptian Fraction as it was used by ancient Egyptians. Following are a
11 min read
Policemen catch thievesGiven an array arr, where each element represents either a policeman (P) or a thief (T). The objective is to determine the maximum number of thieves that can be caught under the following conditions:Each policeman (P) can catch only one thief (T).A policeman can only catch a thief if the distance be
12 min read
Fitting Shelves ProblemGiven length of wall w and shelves of two lengths m and n, find the number of each type of shelf to be used and the remaining empty space in the optimal solution so that the empty space is minimum. The larger of the two shelves is cheaper so it is preferred. However cost is secondary and first prior
9 min read
Assign Mice to HolesThere are N Mice and N holes are placed in a straight line. Each hole can accommodate only 1 mouse. A mouse can stay at his position, move one step right from x to x + 1, or move one step left from x to x -1. Any of these moves consumes 1 minute. Assign mice to holes so that the time when the last m
8 min read
Greedy algorithm on Array
Minimum product subset of an arrayINTRODUCTION: The minimum product subset of an array refers to a subset of elements from the array such that the product of the elements in the subset is minimized. To find the minimum product subset, various algorithms can be used, such as greedy algorithms, dynamic programming, and branch and boun
13 min read
Maximize array sum after K negations using SortingGiven an array of size n and an integer k. We must modify array k number of times. In each modification, we can replace any array element arr[i] by -arr[i]. The task is to perform this operation in such a way that after k operations, the sum of the array is maximum.Examples : Input : arr[] = [-2, 0,
10 min read
Minimum sum of product of two arraysFind the minimum sum of Products of two arrays of the same size, given that k modifications are allowed on the first array. In each modification, one array element of the first array can either be increased or decreased by 2.Examples: Input : a[] = {1, 2, -3} b[] = {-2, 3, -5} k = 5 Output : -31 Exp
14 min read
Minimum sum of absolute difference of pairs of two arraysGiven two arrays a[] and b[] of equal length n. The task is to pair each element of array a to an element in array b, such that sum S of absolute differences of all the pairs is minimum.Suppose, two elements a[i] and a[j] (i != j) of a are paired with elements b[p] and b[q] of b respectively, then p
7 min read
Minimum increment/decrement to make array non-IncreasingGiven an array a, your task is to convert it into a non-increasing form such that we can either increment or decrement the array value by 1 in the minimum changes possible. Examples : Input : a[] = {3, 1, 2, 1}Output : 1Explanation : We can convert the array into 3 1 1 1 by changing 3rd element of a
11 min read
Sorting array with reverse around middleConsider the given array arr[], we need to find if we can sort array with the given operation. The operation is We have to select a subarray from the given array such that the middle element(or elements (in case of even number of elements)) of subarray is also the middle element(or elements (in case
6 min read
Sum of Areas of Rectangles possible for an arrayGiven an array, the task is to compute the sum of all possible maximum area rectangles which can be formed from the array elements. Also, you can reduce the elements of the array by at most 1. Examples: Input: a = {10, 10, 10, 10, 11, 10, 11, 10} Output: 210 Explanation: We can form two rectangles o
13 min read
Largest lexicographic array with at-most K consecutive swapsGiven an array arr[], find the lexicographically largest array that can be obtained by performing at-most k consecutive swaps. Examples : Input : arr[] = {3, 5, 4, 1, 2} k = 3 Output : 5, 4, 3, 2, 1 Explanation : Array given : 3 5 4 1 2 After swap 1 : 5 3 4 1 2 After swap 2 : 5 4 3 1 2 After swap 3
9 min read
Partition into two subsets of lengths K and (N - k) such that the difference of sums is maximumGiven an array of non-negative integers of length N and an integer K. Partition the given array into two subsets of length K and N - K so that the difference between the sum of both subsets is maximum. Examples : Input : arr[] = {8, 4, 5, 2, 10} k = 2 Output : 17 Explanation : Here, we can make firs
7 min read
Greedy algorithm on Operating System
Program for First Fit algorithm in Memory ManagementPrerequisite : Partition Allocation MethodsIn the first fit, the partition is allocated which is first sufficient from the top of Main Memory.Example : Input : blockSize[] = {100, 500, 200, 300, 600}; processSize[] = {212, 417, 112, 426};Output:Process No. Process Size Block no. 1 212 2 2 417 5 3 11
8 min read
Program for Best Fit algorithm in Memory ManagementPrerequisite : Partition allocation methodsBest fit allocates the process to a partition which is the smallest sufficient partition among the free available partitions. Example: Input : blockSize[] = {100, 500, 200, 300, 600}; processSize[] = {212, 417, 112, 426}; Output: Process No. Process Size Bl
8 min read
Program for Worst Fit algorithm in Memory ManagementPrerequisite : Partition allocation methodsWorst Fit allocates a process to the partition which is largest sufficient among the freely available partitions available in the main memory. If a large process comes at a later stage, then memory will not have space to accommodate it. Example: Input : blo
8 min read
Program for Shortest Job First (or SJF) CPU Scheduling | Set 1 (Non- preemptive)The shortest job first (SJF) or shortest job next, is a scheduling policy that selects the waiting process with the smallest execution time to execute next. SJN, also known as Shortest Job Next (SJN), can be preemptive or non-preemptive. Â Characteristics of SJF Scheduling: Shortest Job first has th
13 min read
Job Scheduling with two jobs allowed at a timeGiven a 2d array jobs[][] of order n * 2, where each element jobs[i], contains two integers, representing the start and end time of the job. Your task is to check if it is possible to complete all the jobs, provided that two jobs can be done simultaneously at a particular moment. Note: If a job star
6 min read
Optimal Page Replacement AlgorithmIn operating systems, whenever a new page is referred and not present in memory, page fault occurs, and Operating System replaces one of the existing pages with newly needed page. Different page replacement algorithms suggest different ways to decide which page to replace. The target for all algorit
3 min read
Greedy algorithm on Graph