1076A - Minimizing the String - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define ll long long
const long long MOD = 1e9 + 7, OO = 1e18;
const double PI = acos(-1);
const int N = 1e5 + 5;

ll t = 1;

void solve() {
    int n;
    cin >> n;
    string s;
    cin >> s;
    for (int i =0; i< n-1;i++){
        if (s[i] > s[i+1]){
            for (int j = 0; j < i;j++){
                cout << s[j];
            }
            for (int j = i+1; j < n;j++){
                cout << s[j];
            }
            return ;
        }
    }
    for (int i =0; i< n-1 ;i++) cout << s[i];
    return;
}

int main() {
    IO
    
    // cin >> t;
    while (t--)
    {
        solve();
    }

    return 0;
}