Codeforces Round #822 (Div. 2)C. Minimum Notation

简单的贪心策略 注意实现的方式

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
#define int long long
const int N = 3e5+10;
const int inf = 0x3f3f3f3f;
const int mod = 1e9+7;
int gcd(int a,int b){return b?a:gcd(b,a%b);}
int lcm(int a,int b){return a*b/gcd(a,b);}
int qmi(int a,int b,int mod){int res=1;while(b){if(b&1)res=res*a%mod;b>>=1;a=a*a%mod;}return res;}
int hackt;

int n,q,m;

// int e[N],ne[N],w[N],h[N],idx;
// void add(int a,int b,int c){
	// e[idx] = b,ne[idx] = h[a],w[idx] = c,h[a] = idx++;
// }

bool vis[N];

void solve()
{
	

	string s;cin>>s;
	int len = s.size();
	char t = s[len-1];
	map<char,int>mp;
	
	for(int i=len-1;i>=0;--i){
		if(s[i]>t){
			mp[min((char)(s[i]+1),'9')]++;
		}else if(s[i]<=t){
			t = min(s[i],t);
			mp[s[i]]++;
		}
	}
	
	
	
	for(auto[x,y]:mp){
		while(y--)cout<<x;
	}
	
	cout<<"\n";
	
	
	
	
	

}

signed main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int _;
	cin>>_;
	//_ = 1;
	while(_--)solve();
	return 0;
}