For this Question: Given a string S, you are allowed to remove atmost one character from the string. After the removal process print the lexicographically minimal string that can be obtained.

For example, "aaa" is smaller than "aaaa", "abb" is smaller than "abc", "pqr" is smaller than "z".The first line of the input contains one integer N — the length of S.
The second line of the input contains exactly N lowercase Latin letters — the string S.

(2 ≤ N ≤ 10^5)Print one string — the smallest possible lexicographically string that can be obtained by removing at most one character from the string SInput
3
aaa

Output
aa

Input
5
abcda

Output
abca, I have written this Solution Code: #include "bits/stdc++.h"
#pragma GCC optimize "03"
using namespace std;
 
#define int long long int
#define ld long double
#define pi pair<int, int>
#define pb push_back
#define fi first
#define se second
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#ifndef LOCAL
#define endl '\n'
#endif
 
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;

int a[N];

signed main() {
	IOS;
	int l;	cin >> l;
	string s;	cin >> s;
	s += 'A';
	bool flag = 0;
	for(int i = 0; i < l; i++){
		if(flag == 0 && s[i] > s[i+1])
			flag = 1;
		else
			cout << s[i];
	}
	return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?