Submission #67972488

---

Source Code Expand

// ,,廿_廿,,
#include<iostream>
#include<vector>
using namespace std;
#include<algorithm>
int main(){
	int n,k,x;cin>>n>>k>>x;
	vector<string> s(n);
	for(int i=0;i<n;++i){
		cin >> s[i];
	}

	vector<string> t;
	auto dfs = [&] (auto &r,int c,string str) {
		if(c == k){
			t.emplace_back(str);
			return;
		}
		for(int i=0;i<n;++i){
			r(r,c+1,str+s[i]);
		}
	};
	dfs(dfs,0,"");
	sort(begin(t),end(t));
	cout << t[x-1] << endl;
}

Submission Info

Judge Result