1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
| #include <string>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
string solution(string number, int k) {
string answer = "";
int ans=-1;
vector<int> v;
for(int i=0;i<number.size();i++)
v.push_back(0);
for(int i=0;i<number.size()-k;i++)
v[i]=1;
sort(v.begin(),v.end());
do{
string a;
for(int i=0;i<v.size();i++){
if(v[i]==1)
a+=number[i];
}
int val = stoi(a);
// cout<<val<<" ";
ans=max(ans,val);
}while(next_permutation(v.begin(),v.end()));
return to_string(ans);
}
|