알고스팟 - 튜토리얼 LECTURE

쉽다.

sort 기억하자.

using namespace std;
void sort_func(string origin);
int main(){
	
	int i;
	int num;
	vector input;
	string temp;
	
	cin >> num;
	
	for(i = 0; i < num; i++){
		cin >> temp;
		input.push_back(temp);
	}
	
	for(i = 0; i < num; i++){
		sort_func(input[i]);
	}
	
}
void sort_func(string origin){
	vector devide;
	int i;
	string temp="";
	
	for(i = 0; i < origin.length(); i++){
		
		temp +=origin[i];
		if(i%2 == 1){
			devide.push_back(temp);
			temp = "";
		}
	}
	
	sort(devide.begin(),devide.end());
	
	for(i = 0; i < devide.size(); i++){
		cout << devide[i];
	}
	cout << endl;
}