Accept: 433 Submit: 794
Time Limit: 1000 mSec Memory Limit : 32768 KB
Problem Description
Now you are given one non-negative integer n in 10-base notation, it will only contain digits ('0'-'9'). You are allowed to choose 2 integers i and j, such that: i!=j, 1≤i<j≤|n|, here |n| means the length of n’s 10-base notation. Then we can swap n[i] and n[j].
For example, n=9012, we choose i=1, j=3, then we swap n[1] and n[3], then we get 1092, which is smaller than the original n.
Now you are allowed to operate at most M times, so what is the smallest number you can get after the operation(s)?
Please note that in this problem, leading zero is not allowed!
Input
The first line of the input contains an integer T (T≤100), indicating the number of test cases.
Then T cases, for any case, only 2 integers n and M (0≤n<10^1000, 0≤M≤100) in a single line.
Output
Sample Input
Sample Output
Source
“高教社杯”第三届福建省大学生程序设计竞赛
#include<stdio.h>
#include<string.h>
#define MAXN 1005
#define conve(x) (int)(x-'0')
char num[MAXN];
int main(){
int T;
scanf("%d",&T);
while(T--){
int M;
scanf("%s%d",num,&M);
int size=strlen(num);
int k=0;
while(M&&k<size){
int min=9;
int pos;
for(int j=size-1;j>k;j--){
if(!k){
for(int j=size-1;j>k;j--){
if(conve(num[j])<min&&conve(num[j])>0) {
min=conve(num[j]);
pos=j;
}
}
}else{
if(conve(num[j])<min) {
min=conve(num[j]);
pos=j;
}
}
}
if(num[k]>num[pos]) {
char temp=num[k];
num[k]=num[pos];
num[pos]=temp;
M--;
}
k++;
}
printf("%s\n",num);
}
return 0;
}
///93244789202341654315476541313106165
//4
//13244789202341654315476541313106965
//10244789202341654315476541313136965
//10044789222341654315476541313136965
//10014789222341654315476541313436965
思路,一个从首位开始下标k。另外一个从末尾j找最小,记录下位置pos,如果k所在元素大于pos,交换,总需要交换次数M--,并且k++