[BOJ]1431 - Sort

https://www.acmicpc.net/problem/1431

1431번: 시리얼 번호

 

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;



struct info {
	int sum;
	string str;
};
vector<info> v;

bool F(info a, info b) {
	if (a.str.length() != b.str.length()) {
		return a.str.length() < b.str.length();
	}
	else {
		if (a.sum != b.sum)
			return a.sum < b.sum;
		else
			return a.str < b.str;
	}
}


int cal(info a) {
	int i = 0;
	int sum = 0;

	while (i < a.str.length()) {
		string tmp = "";
		if (a.str[i] >= '0' && a.str[i] <= '9') {
			tmp = a.str[i];
		}
		sum += atoi(tmp.c_str());
		i++;
	}
	return sum;
}
int main() {
	int N;
	cin >> N;
	
	for (int i = 0; i < N; i++) {
		info str;
		cin >> str.str;
		str.sum = cal(str);
		v.push_back(str);
	}

	sort(v.begin(), v.end(), F);

	for (int i = 0; i < N; i++) {
		cout << v[i].str << endl;
	}


	return 0;


}