Not-too-far Replacement || CodeChef Starters 157 || CodeChef Solution

[@cuponcode]

Please give code in comment

[@Bhaiya_Ji_DSA]

#include
#include
#include // For using the swap function
using namespace std;
/**
* Function to minimize the sum of array a based on a condition.
* It modifies the array through a series of swaps and then calculates the sum.
*
* @param n The number of elements in the array.
* @param a A reference to the vector of integers.
* @return The minimized sum of the array.
*/
int minimize_sum(int n, vector& a) {
int a_last = a[n]; // Save the last element of the array
while (true) {
bool swapped = false; // Track if any swap happens
// Iterate through the array
for (int i = 0; i < n; ++i) {
// Check if the current element is less than or equal to twice the last element
if (a[i] > t;
while (t--) {
int n; // Number of elements in the array
cin >> n;
vector a(n + 1); // Vector to store the elements, size n+1 to include the last element
// Input the elements of the array
for (int i = 0; i > a[i];
// Output the minimized sum for the current test case
cout