Remi-incomplet

#include <iostream>

using namespace std;
ifstream cin("remi.in");
ofstream cour("remi.out");
char nr1[1002],nr2[1002],nr3[1002],nr4[1002];
int main()
{
    int n,jj,max1,min1;
    cin>>n>>jj;
    for(i=0;i<n;i++){
        cin>>nr1[i];
        nr2[i]=nr3[i]=nr4[i]=nr1[i];
        max1=max(max1,nr1);
        min1=min(min1,nr1)
    }
    ///start 1
    i=0;
    while(nr1[i]>jj&& i<n)
        i++;
    for(j=n-1;j>=i;j--){
        nr1[j+1]=nr1[j];
        nr2[j+1]=nr2[j];
    }
    nr1[i]=nr2[i]=jj;
    ///facem mutarea diferita
    ///maximul
    i=n-1;
    while(nr1[i]!=max1){
        i--;
    }
    for(j=i;j>0;j++){
        nr1[j]=nr1[j-1];
    }
    nr1[0]=max1;
    ///minimul
    i=0;
    while(nr2[i]>nr2[i+1]){
        i++;
    }
    for(j=i+1;j<n;j++){
        nr2[j+1]=nr2[j];
    }
    ///caz2
    ///maximul
    i=n-1;
    while(nr1[i]!=max1){
        i--;
    }
    for(j=i;j>0;j++){
        nr1[j]=nr1[j-1];
    }
    nr1[0]=max1;
    ///minimul
    i=0;
    while(nr2[i]>nr2[i+1]){
        i++;
    }
    for(j=i+1;j<n;j++){
        nr2[j+1]=nr2[j];
    }
    return 0;
}