Minimum cost of choosing 3 increasing elements in an array of size N
Last Updated :
04 Jun, 2024
Given two arrays arr[] and cost[] where cost[i] is the cost associated with arr[i], the task is to find the minimum cost of choosing three elements from the array such that arr[i] < arr[j] < arr[k].
Examples:
Input: arr[] = {2, 4, 5, 4, 10}, cost[] = {40, 30, 20, 10, 40}
Output: 90
(2, 4, 5), (2, 4, 10) and (4, 5, 10) are
the only valid triplets with cost 90.
Input: arr[] = {1, 2, 3, 4, 5, 6}, cost[] = {10, 13, 11, 14, 15, 12}
Output: 33
Naive approach: A basic approach is two-run three nested loops and to check every possible triplet. The time complexity of this approach will be O(n3).
Approach:
- We can use a brute-force approach to iterate over all possible triplets of elements in the array and check if they form an increasing sequence.
- If a triplet forms an increasing sequence, we calculate its cost by adding the costs of its elements.
- We keep track of the minimum cost seen so far and return it as a result.
The array arr, the related costs cost, and the length of the arrays n are passed to the min_cost_triplet method. It iterates through all potential triplets of elements, tests to see if they form an increasing sequence then computes the triplet's cost. It maintains track of the lowest cost encountered thus far and returns it as the result.
We define the input arrays, determine their length, call the min_cost_triplet function, then print the result in the main function.
Implementation:
C++
#include <bits/stdc++.h>
using namespace std;
int min_cost_triplet(int arr[], int cost[], int n) {
int min_cost = INT_MAX;
// iterate over all possible triplets of elements
for (int i = 0; i < n - 2; i++) {
for (int j = i + 1; j < n - 1; j++) {
for (int k = j + 1; k < n; k++) {
// check if triplet forms an increasing sequence
if (arr[i] < arr[j] && arr[j] < arr[k]) {
int curr_cost = cost[i] + cost[j] + cost[k];
// update minimum cost seen so far
if (curr_cost < min_cost) {
min_cost = curr_cost;
}
}
}
}
}
// return minimum cost of valid triplets
return min_cost;
}
int main() {
int arr[] = {2, 4, 5, 4, 10};
int cost[] = {40, 30, 20, 10, 40};
int n = sizeof(arr) / sizeof(arr[0]);
cout << min_cost_triplet(arr, cost, n) << endl;
return 0;
}
import java.io.*;
import java.util.Arrays;
public class GFG {
public static int minCostTriplet(int[] arr, int[] cost, int n) {
int minCost = Integer.MAX_VALUE;
// iterate over all possible triplets of elements
for (int i = 0; i < n - 2; i++) {
for (int j = i + 1; j < n - 1; j++) {
for (int k = j + 1; k < n; k++) {
// check if triplet forms an increasing sequence
if (arr[i] < arr[j] && arr[j] < arr[k]) {
int currCost = cost[i] + cost[j] + cost[k];
// update minimum cost seen so far
if (currCost < minCost) {
minCost = currCost;
}
}
}
}
}
// return minimum cost of valid triplets
return minCost;
}
public static void main(String[] args) {
int[] arr = {2, 4, 5, 4, 10};
int[] cost = {40, 30, 20, 10, 40};
int n = arr.length;
System.out.println(minCostTriplet(arr, cost, n));
}
}
def min_cost_triplet(arr, cost, n):
min_cost = float('inf')
# iterate over all possible triplets of elements
for i in range(n - 2):
for j in range(i + 1, n - 1):
for k in range(j + 1, n):
# check if triplet forms an increasing sequence
if arr[i] < arr[j] < arr[k]:
curr_cost = cost[i] + cost[j] + cost[k]
# update minimum cost seen so far
if curr_cost < min_cost:
min_cost = curr_cost
# return minimum cost of valid triplets
return min_cost
arr = [2, 4, 5, 4, 10]
cost = [40, 30, 20, 10, 40]
n = len(arr)
print(min_cost_triplet(arr, cost, n))
using System;
public class GFG
{
public static int MinCostTriplet(int[] arr, int[] cost, int n)
{
int minCost = int.MaxValue;
// iterate over all possible triplets of elements
for (int i = 0; i < n - 2; i++)
{
for (int j = i + 1; j < n - 1; j++)
{
for (int k = j + 1; k < n; k++)
{
// check if triplet forms an increasing sequence
if (arr[i] < arr[j] && arr[j] < arr[k])
{
int currCost = cost[i] + cost[j] + cost[k];
// update minimum cost seen so far
if (currCost < minCost)
{
minCost = currCost;
}
}
}
}
}
// return minimum cost of valid triplets
return minCost;
}
public static void Main(string[] args)
{
int[] arr = { 2, 4, 5, 4, 10 };
int[] cost = { 40, 30, 20, 10, 40 };
int n = arr.Length;
Console.WriteLine(MinCostTriplet(arr, cost, n));
}
}
//This code is contributed by aeroabrar_31
function minCostTriplet(arr, cost, n) {
let minCost = Number.MAX_VALUE;
// Iterate over all possible triplets of elements
for (let i = 0; i < n - 2; i++) {
for (let j = i + 1; j < n - 1; j++) {
for (let k = j + 1; k < n; k++) {
// Check if triplet forms an increasing sequence
if (arr[i] < arr[j] && arr[j] < arr[k]) {
const currCost = cost[i] + cost[j] + cost[k];
// Update minimum cost seen so far
if (currCost < minCost) {
minCost = currCost;
}
}
}
}
}
// Return minimum cost of valid triplets
return minCost;
}
function main() {
const arr = [2, 4, 5, 4, 10];
const cost = [40, 30, 20, 10, 40];
const n = arr.length;
console.log(minCostTriplet(arr, cost, n));
}
main();
//This code is contributed by aeroabrar_31
Time Complexity: O(n^3), where n is the size of the given arrays.
Auxiliary Space: O(1), no extra space is required, so it is a constant.
Efficient approach: An efficient approach is to fix the middle element and search for the smaller element with minimum cost on its left and the larger element with minimum cost on its right in the given array. If a valid triplet is found then update the minimum cost far. The time complexity of this approach will be O(n2).
Below is the implementation of the above approach:
C++
// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
// Function to return the minimum required cost
int minCost(int arr[], int cost[], int n)
{
// To store the cost of choosing three elements
int costThree = INT_MAX;
// Fix the middle element
for (int j = 0; j < n; j++) {
// Initialize cost of the first
// and the third element
int costI = INT_MAX, costK = INT_MAX;
// Search for the first element
// in the left subarray
for (int i = 0; i < j; i++) {
// If smaller element is found
// then update the cost
if (arr[i] < arr[j])
costI = min(costI, cost[i]);
}
// Search for the third element
// in the right subarray
for (int k = j + 1; k < n; k++) {
// If greater element is found
// then update the cost
if (arr[k] > arr[j])
costK = min(costK, cost[k]);
}
// If a valid triplet was found then
// update the minimum cost so far
if (costI != INT_MAX && costK != INT_MAX) {
costThree = min(costThree, cost[j]
+ costI
+ costK);
}
}
// No such triplet found
if (costThree == INT_MAX)
return -1;
return costThree;
}
// Driver code
int main()
{
int arr[] = { 2, 4, 5, 4, 10 };
int cost[] = { 40, 30, 20, 10, 40 };
int n = sizeof(arr) / sizeof(arr[0]);
cout << minCost(arr, cost, n);
return 0;
}
// Java implementation of the approach
class GFG
{
// Function to return the minimum required cost
static int minCost(int arr[], int cost[], int n)
{
// To store the cost of choosing three elements
int costThree = Integer.MAX_VALUE;
// Fix the middle element
for (int j = 0; j < n; j++)
{
// Initialize cost of the first
// and the third element
int costI = Integer.MAX_VALUE;
int costK = Integer.MAX_VALUE;
// Search for the first element
// in the left subarray
for (int i = 0; i < j; i++)
{
// If smaller element is found
// then update the cost
if (arr[i] < arr[j])
costI = Math.min(costI, cost[i]);
}
// Search for the third element
// in the right subarray
for (int k = j + 1; k < n; k++)
{
// If greater element is found
// then update the cost
if (arr[k] > arr[j])
costK = Math.min(costK, cost[k]);
}
// If a valid triplet was found then
// update the minimum cost so far
if (costI != Integer.MAX_VALUE &&
costK != Integer.MAX_VALUE)
{
costThree = Math.min(costThree, cost[j] +
costI + costK);
}
}
// No such triplet found
if (costThree == Integer.MAX_VALUE)
return -1;
return costThree;
}
// Driver code
public static void main (String[] args)
{
int arr[] = { 2, 4, 5, 4, 10 };
int cost[] = { 40, 30, 20, 10, 40 };
int n = arr.length;
System.out.println(minCost(arr, cost, n));
}
}
// This code is contributed by AnkitRai01
# Python3 implementation of the approach
# Function to return the minimum required cost
def minCost(arr, cost, n):
# To store the cost of choosing three elements
costThree = 10**9
# Fix the middle element
for j in range(n):
# Initialize cost of the first
# and the third element
costI = 10**9
costK = 10**9
# Search for the first element
# in the left subarray
for i in range(j):
# If smaller element is found
# then update the cost
if (arr[i] < arr[j]):
costI = min(costI, cost[i])
# Search for the third element
# in the right subarray
for k in range(j + 1, n):
# If greater element is found
# then update the cost
if (arr[k] > arr[j]):
costK = min(costK, cost[k])
# If a valid triplet was found then
# update the minimum cost so far
if (costI != 10**9 and costK != 10**9):
costThree = min(costThree, cost[j] +
costI + costK)
# No such triplet found
if (costThree == 10**9):
return -1
return costThree
# Driver code
arr = [2, 4, 5, 4, 10]
cost = [40, 30, 20, 10, 40]
n = len(arr)
print(minCost(arr, cost, n))
# This code is contributed by Mohit Kumar
// C# implementation of the approach
using System;
class GFG
{
// Function to return the
// minimum required cost
static int minCost(int []arr,
int []cost, int n)
{
// To store the cost of
// choosing three elements
int costThree = int.MaxValue;
// Fix the middle element
for (int j = 0; j < n; j++)
{
// Initialize cost of the first
// and the third element
int costI = int.MaxValue;
int costK = int.MaxValue;
// Search for the first element
// in the left subarray
for (int i = 0; i < j; i++)
{
// If smaller element is found
// then update the cost
if (arr[i] < arr[j])
costI = Math.Min(costI, cost[i]);
}
// Search for the third element
// in the right subarray
for (int k = j + 1; k < n; k++)
{
// If greater element is found
// then update the cost
if (arr[k] > arr[j])
costK = Math.Min(costK, cost[k]);
}
// If a valid triplet was found then
// update the minimum cost so far
if (costI != int.MaxValue &&
costK != int.MaxValue)
{
costThree = Math.Min(costThree, cost[j] +
costI + costK);
}
}
// No such triplet found
if (costThree == int.MaxValue)
return -1;
return costThree;
}
// Driver code
static public void Main ()
{
int []arr = { 2, 4, 5, 4, 10 };
int []cost = { 40, 30, 20, 10, 40 };
int n = arr.Length;
Console.Write(minCost(arr, cost, n));
}
}
// This code is contributed by Sachin..
// JavaScript implementation of the approach
// Function to return the minimum required cost
function minCost(arr,cost,n)
{
// To store the cost of choosing three elements
let costThree = Number.MAX_VALUE;
// Fix the middle element
for (let j = 0; j < n; j++)
{
// Initialize cost of the first
// and the third element
let costI = Number.MAX_VALUE;
let costK = Number.MAX_VALUE;
// Search for the first element
// in the left subarray
for (let i = 0; i < j; i++)
{
// If smaller element is found
// then update the cost
if (arr[i] < arr[j])
costI = Math.min(costI, cost[i]);
}
// Search for the third element
// in the right subarray
for (let k = j + 1; k < n; k++)
{
// If greater element is found
// then update the cost
if (arr[k] > arr[j])
costK = Math.min(costK, cost[k]);
}
// If a valid triplet was found then
// update the minimum cost so far
if (costI != Number.MAX_VALUE &&
costK != Number.MAX_VALUE)
{
costThree = Math.min(costThree, cost[j] +
costI + costK);
}
}
// No such triplet found
if (costThree == Number.MAX_VALUE)
return -1;
return costThree;
}
// Driver code
let arr=[2, 4, 5, 4, 10];
let cost=[40, 30, 20, 10, 40 ];
let n = arr.length;
console.log(minCost(arr, cost, n));
// This code is contributed by unknown2108
Time Complexity: O(n2), where n is the size of the given arrays.
Auxiliary Space: O(1), no extra space is required, so it is a constant.
Similar Reads
Sum of minimum elements of all possible sub-arrays of an array Given an array arr[], the task is to find the sum of the minimum elements of every possible sub-array of the array. Examples: Input: arr[] = {1, 3, 2} Output: 15 All possible sub-arrays are {1}, {2}, {3}, {1, 3}, {3, 2} and {1, 3, 2} And, the sum of all the minimum elements is 1 + 2 + 3 + 1 + 2 + 1
9 min read
Maximize frequency of an element by at most one increment or decrement of all array elements Given an array arr[] of size N, the task is to find the maximum frequency of any array element by incrementing or decrementing each array element by 1 at most once. Examples: Input: arr[] = { 3, 1, 4, 1, 5, 9, 2 } Output: 4 Explanation: Decrementing the value of arr[0] by 1 modifies arr[] to { 2, 1,
8 min read
Number of steps to sort the array by changing order of three elements in each step Given an array arr[] of size N consisting of unique elements in the range [0, N-1], the task is to find K which is the number of steps required to sort the given array by selecting three distinct elements and rearranging them. And also, print the indices selected in those K steps in K lines. For exa
15+ min read
C++ Program for Shortest Un-ordered Subarray An array is given of n length, and problem is that we have to find the length of shortest unordered {neither increasing nor decreasing} sub array in given array.Examples: Input : n = 5 7 9 10 8 11 Output : 3 Explanation : 9 10 8 unordered sub array. Input : n = 5 1 2 3 4 5 Output : 0 Explanation : A
2 min read
Minimum cost of choosing the array element Given an array arr[] of N integers and an integer M and the cost of selecting any array element(say x) at any day(say d), is x*d. The task is to minimize the cost of selecting 1, 2, 3, ..., N array where each day at most M elements is allowed to select.Examples: Input: arr[] = {6, 19, 3, 4, 4, 2, 6,
7 min read