[백준 1431] 시리얼 번호

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

1431번: 시리얼 번호

 

요구사항

조건 대로 정렬하기

 

풀이

merge를 구현하였다.

구조체로 합, 길이, str을 한군데 넣고 mer 구현

 

#include <iostream>
#include <string>

using namespace std;
struct go {
	int len;
	int sum;
	string str;
};

int n;
go map[1010];
go buf[1010];
void mer(go arr[], int len) {
	//cout << "B" << endl;
	if (len < 2) return;
	int i, j, mid, k;
	mid = len / 2;
	i = 0; j = mid; k = 0;
	mer(arr, mid);
	mer(arr + mid, len - mid);

	while (i < mid && j<len) {
	//	cout << "a" << endl;
		if (arr[i].len < arr[j].len) {
			buf[k++] = arr[i++];
		}
		else if (arr[i].len == arr[j].len) {
			if (arr[i].sum < arr[j].sum) {
				buf[k++] = arr[i++];
			}
			else if (arr[i].sum == arr[j].sum) {
				if (arr[i].str < arr[j].str) {
					buf[k++] = arr[i++];
				}
				else {
					buf[k++] = arr[j++];
				}
			}
			else {
				buf[k++] = arr[j++];
			}
		}
		else {
			buf[k++] = arr[j++];
		}
	}

	while (i < mid) {
	//	cout << "C" << endl;
		buf[k++] = arr[i++];
	}
	while (j < len) {
	//	cout << "D" << endl;
		buf[k++] = arr[j++];
	}
	for (int i = 0; i < len; i++) {
	//	cout << "E" << endl;
		arr[i] = buf[i];
	}
}
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> map[i].str;
		map[i].len = map[i].str.length();
		map[i].sum = 0;
		for (int j = 0; j < map[i].len; j++) {
			int now = (int)(map[i].str.at(j));
			if (now >= 49 && now <= 57) {
				map[i].sum += (now - 48);
			}
		}
	}
	mer(map, n);
	for (int i = 0; i < n; i++) {
	//	cout << map[i].str << " " << map[i].len << " " << map[i].sum << endl;
		cout << map[i].str << endl;
	}
}