Codeforces Solution-A. Replacement-Solution in C, C++, Java, Python

5
1 2 3 4 5

1 1 2 3 4

5
2 3 4 5 6

1 2 3 4 5

3
2 2 2

1 2 2

#1 Code Example with C++ Programming

Code - C++ Programming

#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>

int main(){

    long n; scanf("%ld", &n);
    std::vector<long> array(n);
    long maxElement(0), maxPos(0);

    for(long p = 0; p < n; p++){
        scanf("%ld", &array[p]);
        if(array[p] > maxElement){maxElement = array[p]; maxPos = p;}
    }

    if(maxElement == 1){array[maxPos] = 2;}
    else{array[maxPos] = 1;}

    sort(array.begin(), array.end());
    for(long p = 0; p < n; p++){printf("%ld ", array[p]);}

    return 0;
}

Copy The Code & Try With Live Editor

Input

Output