Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstdio>
- #include <algorithm>
- #include <cstring>
- #include <string>
- #include <cctype>
- #include <stack>
- #include <bitset>
- #include <queue>
- #include <list>
- #include <vector>
- #include <map>
- #include <set>
- #include <iterator>
- #include <sstream>
- #include <stdlib.h>
- #include <cmath>
- #define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
- #define debug( x ) cout << #x << " = " << x << endl
- #define clr(v,x) memset( v, x , sizeof v )
- #define all(x) (x).begin() , (x).end()
- #define rall(x) (x).rbegin() , (x).rend()
- #define TAM 110
- using namespace std;
- typedef pair<int,int> ii ;
- typedef long long ll ;
- typedef long double ld ;
- typedef pair<int,ii> pii ;
- int main() {
- int t,n,l;string cad,aux;
- scanf("%d",&t);getchar();
- int index=0;
- while(t--){
- getline(cin,cad);index=0;
- scanf("%d",&l);getchar();
- n=cad.size();
- string maxi="ZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ";
- //cout<<cad<<endl;
- for(int i=0;i<=n-l;i++){
- aux=cad.substr(i,l);
- sort(all(aux));
- // cout<<aux<<endl;
- string ans="";
- for(int j=0;j<i;j++) ans+=cad[j];
- ans+=aux;
- for(int j=i+l;j<cad.size();j++)ans+=cad[j];
- //cout<<ans<<endl;
- if(ans<maxi) {maxi=ans;}
- }
- //cout<<maxi<<endl;
- //cout<<index<<endl;
- cout<<maxi<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement