贪心。
尽量把最后面最小的数拿到前面来。
#pragma comment(linker, "/STACK:1024000000,1024000000") #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #include<vector> #include<map> #include<set> #include<queue> #include<stack> #include<iostream> using namespace std; typedef long long LL; const double pi=acos(-1.0),eps=1e-8; void File() { freopen("D:\\in.txt","r",stdin); freopen("D:\\out.txt","w",stdout); } template <class T> inline void read(T &x) { char c = getchar(); x = 0;while(!isdigit(c)) c = getchar(); while(isdigit(c)) { x = x * 10 + c - '0'; c = getchar(); } } const int maxn=1010; char s[maxn]; int T,m; int main() { scanf("%d",&T); while(T--) { scanf("%s%d",s,&m); int len=strlen(s); if(len==1&&s[0]=='0') { printf("0\n"); continue; } if(m==0) { printf("%s\n",s); continue; } int Min=999; for(int j=1;j<len;j++) { if(s[j]=='0') continue; Min=min(Min,(int)s[j]); } if(Min<s[0]) { int pos=-1; for(int j=1;j<len;j++) if((int)s[j]==Min) pos=j; swap(s[pos],s[0]); m--; } for(int i=1;i<len;i++) { if(m==0) break; int Min=999; for(int j=i+1;j<len;j++) Min=min(Min,(int)s[j]); if(Min>=s[i]) continue; int pos=-1; for(int j=i+1;j<len;j++) if((int)s[j]==Min) pos=j; swap(s[pos],s[i]); m--; } printf("%s\n",s); } return 0; }