Minimum cost to equal all elements of array using two operation
Last Updated :
18 Aug, 2022
Given an array arr[] of n positive integers. There are two operations allowed:
- Operation 1 : Pick any two indexes, increase value at one index by 1 and decrease value at another index by 1. It will cost a.
- Operation 2 : Pick any index and increase its value by 1. It will cost b.
The task is to find the minimum cost to make all the elements equal in the array.
Examples:
Input : n = 4, a = 2, b = 3
arr[] = { 3, 4, 2, 2 }
Output : 5
Perform operation 2 on 3rd index
(0 based indexing). It will cost 2.
Perform operation 1 on index 1 (decrease)
and index 2 (increase). It will cost 3.
Input : n = 3, a = 2, b = 1
arr[] = { 5, 5, 5 }
Output : 0
Approach:
Observe, the final array will not have elements greater than the maximum element of the given array because there is no sense to increase all the elements. Also, they will greater than the minimal element in the original array. Now, iterate over all the possible value of the final array element which needs to be equal and check how many operations of second type must be performed.
For elements to be i (which is one of the possible value of final array element) that number is (n * i - s), where s is the sum of all numbers in the array. The number of operation of the first type for element to be i in the final array can be find by:
for (int j = 0; j < n; j++)
op1 += max(0, a[j] - i)
At the end of each iteration simply check whether the new value ans = (n * i - s) * b + op1 * a is less than previous value of ans. If it is less, update the final ans.
Below is the implementation of above approach.
C++
// CPP Program to find the minimum cost to equal
// all elements of array using two operation
#include <bits/stdc++.h>
using namespace std;
// Return the minimum cost required
int minCost(int n, int arr[], int a, int b)
{
int sum = 0, ans = INT_MAX;
int maxval = 0;
// finding the maximum element and sum of the array.
for (int i = 0; i < n; i++) {
sum += arr[i];
maxval = max(maxval, arr[i]);
}
// for each of the possible value
for (int i = 1; i <= maxval; i++) {
int op1 = 0;
// finding the number of operation 1 required
for (int j = 0; j < n; j++)
op1 += max(0, arr[j] - i);
// finding the minimum cost.
if (sum <= n * i)
ans = min(ans, (n * i - sum) * b + op1 * a);
}
return ans;
}
// Driven Code
int main()
{
int n = 4, a = 2, b = 3;
int arr[] = { 3, 4, 2, 2 };
cout << minCost(n, arr, a, b) << endl;
return 0;
}
Java
// Java Program to find the minimum cost
// to equal all elements of array using
// two operation
import java.lang.*;
class GFG {
// Return the minimum cost required
static int minCost(int n, int arr[],
int a, int b)
{
int sum = 0, ans = Integer.MAX_VALUE;
int maxval = 0;
// finding the maximum element and
// sum of the array.
for (int i = 0; i < n; i++) {
sum += arr[i];
maxval = Math.max(maxval, arr[i]);
}
// for each of the possible value
for (int i = 1; i <= maxval; i++) {
int op1 = 0;
// finding the number of operation
// 1 required
for (int j = 0; j < n; j++)
op1 += Math.max(0, arr[j] - i);
// finding the minimum cost.
if (sum <= n * i)
ans = Math.min(ans, (n * i - sum)
* b + op1 * a);
}
return ans;
}
// Driven Code
public static void main(String [] args)
{
int n = 4, a = 2, b = 3;
int arr[] = { 3, 4, 2, 2 };
System.out.println(minCost(n, arr, a, b));
}
}
// This code is contributed by Smitha.
python3
# Python 3 Program to find the minimum
# cost to equal all elements of array
# using two operation
import sys
# Return the minimum cost required
def minCost(n, arr, a, b):
sum = 0
ans = sys.maxsize
maxval = 0
# finding the maximum element and
# sum of the array.
for i in range(0, n) :
sum += arr[i]
maxval = max(maxval, arr[i])
# for each of the possible value
for i in range(0, n) :
op1 = 0
# finding the number of operation
# 1 required
for j in range(0, n) :
op1 += max(0, arr[j] - i)
# finding the minimum cost.
if (sum <= n * i):
ans = min(ans, (n * i - sum)
* b + op1 * a)
return ans
# Driven Code
n = 4
a = 2
b = 3
arr = [3, 4, 2, 2]
print(minCost(n, arr, a, b))
# This code is contributed by Smitha
C#
// C# Program to find the minimum
// cost to equal all elements of
// array using two operation
using System;
class GFG {
// Return the minimum cost required
static int minCost(int n, int [] arr,
int a, int b)
{
int sum = 0, ans = int.MaxValue;
int maxval = 0;
// finding the maximum element and
// sum of the array.
for (int i = 0; i < n; i++) {
sum += arr[i];
maxval = Math.Max(maxval, arr[i]);
}
// for each of the possible value
for (int i = 1; i <= maxval; i++) {
int op1 = 0;
// finding the number of operation
// 1 required
for (int j = 0; j < n; j++)
op1 += Math.Max(0, arr[j] - i);
// finding the minimum cost.
if (sum <= n * i)
ans = Math.Min(ans, (n * i - sum)
* b + op1 * a);
}
return ans;
}
// Driven Code
public static void Main()
{
int n = 4, a = 2, b = 3;
int []arr= { 3, 4, 2, 2 };
Console.Write(minCost(n, arr, a, b));
}
}
// This code is contributed by Smitha
PHP
<?php
//PHP Program to find the minimum cost
// to equal all elements of array using
// two operation
// Return the minimum cost required
function minCost($n, $arr, $a, $b)
{
$sum = 0; $ans = PHP_INT_MAX;
$maxval = 0;
// finding the maximum element and
// sum of the array.
for ($i = 0; $i < $n; $i++) {
$sum += $arr[$i];
$maxval = max($maxval, $arr[$i]);
}
// for each of the possible value
for ($i = 1; $i <= $maxval; $i++) {
$op1 = 0;
// finding the number of operation
// 1 required
for ($j = 0; $j < $n; $j++)
$op1 += max(0, $arr[$j] - $i);
// finding the minimum cost.
if ($sum <= $n * $i)
$ans = min($ans, ($n * $i - $sum)
* $b + $op1 * $a);
}
return $ans;
}
// Driven Code
$n = 4; $a = 2; $b = 3;
$arr= array(3, 4, 2, 2 );
echo minCost($n, $arr, $a, $b) ,"\n";
// This code is contributed by ajit
?>
JavaScript
<script>
// javascript Program to find the minimum cost
// to equal all elements of array using
// two operation
// Return the minimum cost required
function minCost(n , arr , a , b)
{
var sum = 0, ans = Number.MAX_VALUE;
var maxval = 0;
// finding the maximum element and
// sum of the array.
for (i = 0; i < n; i++) {
sum += arr[i];
maxval = Math.max(maxval, arr[i]);
}
// for each of the possible value
for (i = 1; i <= maxval; i++) {
var op1 = 0;
// finding the number of operation
// 1 required
for (j = 0; j < n; j++)
op1 += Math.max(0, arr[j] - i);
// finding the minimum cost.
if (sum <= n * i)
ans = Math.min(ans, (n * i - sum) * b + op1 * a);
}
return ans;
}
// Driven Code
var n = 4, a = 2, b = 3;
var arr = [ 3, 4, 2, 2 ];
document.write(minCost(n, arr, a, b));
// This code contributed by umadevi9616
</script>
Similar Reads
DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
SQL Commands | DDL, DQL, DML, DCL and TCL Commands SQL commands are crucial for managing databases effectively. These commands are divided into categories such as Data Definition Language (DDL), Data Manipulation Language (DML), Data Control Language (DCL), Data Query Language (DQL), and Transaction Control Language (TCL). In this article, we will e
7 min read
Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read
Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T
9 min read
Array Data Structure Guide In this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
4 min read