Maximize the minimum Array value by changing elements with adjacent K times
Last Updated :
08 Oct, 2023
Given an array arr[] of N integers and an integer K, where K denotes the maximum number of operations which can be applied to the array, the task is to maximize the minimum value of arr[] by using the given operation at most K times.
- In one operation it is possible to select any element of the given arr[] and can change it with its adjacent element.
Examples:
Input: N = 7, K = 4, arr[] = {9, 7, 3, 5, 7, 8, 7}
Output: 7
Explanation: First operation: Change 3 at index 2 with 7 at index 1.
So the arr[] becomes: {9, 7, 7, 5, 7, 8, 7}
Second Operation: Change 5 at index 3 with 7 at index 2.
So the arr[] becomes: {9, 7, 7, 7, 7, 8, 7}
Third operation: Change 7 at index 6 with 8 at index 5.
So the arr[] becomes: {9, 7, 7, 7, 7, 8, 8}
Fourth Operation: Change 7 at index 1 with 9 at index 0.
So the arr[] becomes: {9, 9, 7, 7, 7, 8, 8}
The minimum value in arr[] after applying operation at most K times is: 7
Input: N = 4, K = 2, arr[] = {2, 5, 6, 8}
Output: 6
Explanation: First operation: Change 5 at index 1 with 6 at index 2.
So that the arr[] becomes: {2, 6, 6, 8}
Second operation: Change 2 at index 0 with 6 at index 1.
So that the arr[] becomes: {6, 6, 6, 8}
The minimum value of arr[] can be achieved by applying operations is: 6
Approach: To solve the problem follow the below idea:
Sort the arr[], if K is greater than or equal to length of arr[], simply return element at last index of arr[] else return element at Kth index of arr[].
Illustration with an Example:
Consider N = 6, K = 3, arr[] = {9, 7, 3, 1, 2, 5}
We can perform the following operations
Operation 1:- Change 2 at index 4 with 5 at index 5 . So the arr[] becomes: {9, 7, 3, 1, 5, 5}
Operation 2:- Change 1 at index 3 with 5 at index 4 . So the arr[] becomes: {9, 7, 3, 5, 5, 5}
Operation 3:- Change 3 at index 2 with 7 at index 1 . So the arr[] becomes: {9, 7, 7, 5, 5, 5}
Minimum element after applying operation at most 3 times is: 5
When you will sort the arr[] and return arr[K] you will get the same output :-
Sorted arr[]: {1, 2, 3, 5, 7, 9}
arr[K] = arr[3] = 5, which is out required answer.
Follow the steps to solve the problem:
- Sort the array.
- Check if K is greater than or equal to arr[] or not.
- If yes, then simply return the element at the last index of arr[].
- Else return the element at the Kth index of arr[].
- Print the output.
Below is the implementation for the above approach:
C++
// C++ code to implement the approach.
#include <bits/stdc++.h>
using namespace std;
int main() {
int N = 6, K = 3 ;
int arr[] = { 9, 1, 3, 7, 2, 5 } ;
// Sorting the Array
sort( arr, arr+N ) ;
// Condition when K is greater than
// or equal to length of arr[] then
// returning element at last
// index of arr[]
if( K >= N )
cout << arr[ N-1 ] ;
// if K is less than length of
// arr[] then returning element at Xth position
else
cout << arr[ K ] ;
return 0;
}
// This code is contributed by rahulbhardwaj0711.
// Java code to implement the approach.
import java.util.*;
class GFG {
// Driver code
public static void main(String[] args)
{
int N = 6, K = 3;
int[] arr = { 9, 7, 3, 1, 2, 5 };
// Function call
System.out.println(Min_Value(N, K, arr));
}
// Function which is called in main()
static int Min_Value(int N, int K, int arr[])
{
// Sorting arr[] with inbuilt sort
// function in Arrays class
Arrays.sort(arr);
// Condition when K is greater than
// or equal to length of arr[] then
// returning element at last
// index of arr[]
if (K == arr.length || K > arr.length)
return (arr[arr.length - 1]);
// if K is less than length of
// arr[] then returning
// element at Xth position
else
return (arr[K]);
}
}
# python3 code to implement the approach.
if __name__ == "__main__":
N = 6
K = 3
arr = [9, 1, 3, 7, 2, 5]
# Sorting the Array
arr.sort()
# Condition when K is greater than
# or equal to length of arr[] then
# returning element at last
# index of arr[]
if(K >= N):
print(arr[N-1])
# if K is less than length of
# arr[] then returning element at Xth position
else:
print(arr[K])
# This code is contributed by rakeshsahni
// C# code to implement the approach.
using System;
public class GFG {
static public void Main()
{
// Code
int N = 6, K = 3;
int[] arr = { 9, 7, 3, 1, 2, 5 };
// Function call
Console.WriteLine(Min_Value(N, K, arr));
}
// Function which is called in main()
static int Min_Value(int N, int K, int[] arr)
{
// Sorting arr[] with inbuilt sort
// function in Arrays class
Array.Sort(arr);
// Condition when K is greater than
// or equal to length of arr[] then
// returning element at last
// index of arr[]
if (K == arr.Length || K > arr.Length)
return (arr[arr.Length - 1]);
// if K is less than length of
// arr[] then returning
// element at Xth position
else
return (arr[K]);
}
}
// This code is contributed by lokeshmvs21.
<script>
let N = 6, K = 3;
let arr = [9, 1, 3, 7, 2, 5];
// Sorting the Array
arr.sort();
// Condition when K is greater than
// or equal to length of arr[] then
// returning element at last
// index of arr[]
if( K >= N )
document.write(arr[N-1],"</br>");
// if K is less than length of
// arr[] then returning element at Xth position
else
document.write(arr[K],"</br>");
// This code is contributed by Rohit Pradhan
</script>
Time Complexity: O(N * logN), because sorting is performed.
Auxiliary Space: O(1), as no extra space is required.
Another Approach:
- Sort the input array in non-decreasing order. We can use any sorting algorithm like quicksort, heapsort, or mergesort to do this.
- Check if the value of K is greater than or equal to the length of the array. If it is, then we can simply return the last element of the sorted array as this would be the maximum possible value that can be achieved after applying K operations.
- If the value of K is less than the length of the array, then we need to determine the maximum value that can be achieved by applying K operations.
- We can achieve this by repeatedly swapping adjacent elements that are
C++
// C++ code to implement the approach.
#include <bits/stdc++.h>
using namespace std;
int main() {
int N = 6, K = 3 ;
int arr[] = { 9, 1, 3, 7, 2, 5 } ;
// Partial sorting the array up to the Kth element
nth_element(arr, arr+K, arr+N);
// Condition when K is greater than
// or equal to length of arr[] then
// returning element at last
// index of arr[]
if( K >= N )
cout << arr[ N-1 ] ;
// if K is less than length of
// arr[] then returning element at Xth position
else
cout << arr[ K ] ;
return 0;
}
import java.util.Arrays;
public class Main {
public static void main(String[] args) {
int N = 6, K = 3;
int[] arr = { 9, 1, 3, 7, 2, 5 };
// Partial sorting the array up to the Kth element
Arrays.sort(arr);
// Condition when K is greater than
// or equal to the length of arr[], then
// returning the element at the last
// index of arr[]
if (K >= N) {
System.out.println(arr[N - 1]);
}
// if K is less than the length of
// arr[] then returning the element at the Kth
// position
else {
System.out.println(arr[K]);
}
}
}
# python3 code to implement the approach.
if __name__ == "__main__":
N = 6
K = 3
arr = [9, 1, 3, 7, 2, 5]
# Partial sorting the array up to the Kth element
arr.sort()
# Condition when K is greater than
# or equal to length of arr[] then
# returning element at last
# index of arr[]
if(K >= N):
print(arr[N-1])
# if K is less than length of
# arr[] then returning element at Xth position
else:
print(arr[K])
# This code is contributed by Prajwal Kandekar
using System;
public class Program {
public static void Main()
{
int N = 6, K = 3;
int[] arr = { 9, 1, 3, 7, 2, 5 };
// Partial sorting the array up to the Kth element
Array.Sort(arr);
// Condition when K is greater than
// or equal to the length of arr[] then
// returning the element at the last
// index of arr[]
if (K >= N) {
Console.WriteLine(arr[N - 1]);
}
// if K is less than the length of
// arr[] then returning the element at the Kth
// position
else {
Console.WriteLine(arr[K]);
}
}
}
// JS code to implement the approach.
let N = 6, K = 3 ;
let arr = [ 9, 1, 3, 7, 2, 5 ];
// Partial sorting the array up to the Kth element
arr.sort((a, b) => a - b);
// Condition when K is greater than
// or equal to length of arr[] then
// returning element at last
// index of arr[]
if( K >= N )
console.log(arr[ N-1 ]) ;
// if K is less than length of
// arr[] then returning element at Xth position
else
console.log(arr[ K ]) ;
Time Complexity: O(N*logN)
Auxiliary Space: O(1)
Similar Reads
Maximize value at Kth index to create N size array with adjacent difference 1 and sum less than M
Given three numbers N, K, and M, the task is to find the maximum value that can be assigned to the Kth index if positive values are assigned to all N indices such that the total sum of values is less than M, and the difference between the values at adjacent positions is atmost 1. Examples: Input : N
11 min read
Minimize the max of Array by breaking array elements at most K times
Given an integer array arr[] of size N and a positive integer K, the task is to minimize the maximum of the array by replacing any element arr[i] into two positive elements (X, Y) at most K times such that arr[i] = X + Y. Examples: Input: arr = {9}, K = 2Output: 3Explanation: Operation 1: Replace el
15+ min read
Maximize sum of absolute difference between adjacent elements in Array with sum K
Given two integers N and K, the task is to maximize the sum of absolute differences between adjacent elements of an array of length N and sum K. Examples: Input: N = 5, K = 10 Output: 20 Explanation: The array arr[] with sum 10 can be {0, 5, 0, 5, 0}, maximizing the sum of absolute difference of adj
4 min read
Minimize the cost to make all the adjacent elements distinct in an Array
Given two integer arrays arr[] and cost[] of size N, the task is to make all adjacent elements distinct at minimum cost. cost[i] denotes the cost to increment ith element by 1.Examples: Input: arr[] = {2, 2, 3}, cost[] = {4, 1, 5} Output: 2 Explanation: The second element has minimum increment cost.
9 min read
Minimize the maximum value in array by incrementing and decrementing.
Given array arr[] of size N, the task is to minimize the maximum value in given array by increasing arr[i] by 1 and decreasing arr[i + 1] by 1 any number of times. Examples: Input: arr[] = {3, 7, 1, 6} Output: 5Explanation: Initially we have arr[] = {3, 7, 1, 6} Choose i = 1 (considering 1 index), a
9 min read
Maximize bitwise AND of Array by changing at most K bits of elements
Given an array arr[] of length N. You can perform at most K operations on the array of the following type: Choose an index i (0 ? i ? N-1) and set the j-th bit of arr[i] to 1 (0 ? j ? 30). The task is to find the maximum possible value of bitwise AND of all array elements after performing at most K
8 min read
Maximum sum of Array formed by replacing each element with sum of adjacent elements
Given an array arr[] of size N, the task is to find the maximum sum of the Array formed by replacing each element of the original array with the sum of adjacent elements.Examples: Input: arr = [4, 2, 1, 3] Output: 23 Explanation: Replacing each element of the original array with the sum of adjacent
9 min read
Minimize the maximum of Array by replacing any element with other element at most K times
Given an array arr[] of size N and an integer K, the task is to minimize the value of the maximum element of the array arr[] after replacing any element of the array with any other element of that array at most K times.Examples:Input: arr[] = {5, 3, 3, 2, 1}, K = 3Output: 2Explanation: Replace the e
8 min read
Maximize the minimum element of Array by reducing elements one by one
Given an array arr[] containing N integers. In each operation, a minimum integer is chosen from the array and deleted from the array after subtracting it from the remaining elements. The task is to find the maximum of minimum values of the array after any number of such operations. Examples: Input:
6 min read
Maximize the minimum array element by M subarray increments of size S
Given an array arr[] of N integers and two integers S and M, the task is to maximize the minimum array element by incrementing any subarray of size S by 1, M number of times. Examples: Input: arr[] = {1, 2, 3, 4, 5, 6}, S = 2, M = 3Output: 3Explanation:Below are the operations performed:Operation 1:
10 min read