BOJ / 1431번 / 시리얼 번호 [Go][Python3]

👩🏻‍💻 문제

1431번: 시리얼 번호

---

✍🏻 풀이

🎨 Go

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

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

func main() {
	reader := bufio.NewReader(os.Stdin)
	writer := bufio.NewWriter(os.Stdout)
	defer writer.Flush()

	var n int
	fmt.Fscanln(reader, &n)

	var serials = make([]string, n)
	for i := 0; i < n; i++ {
		fmt.Fscanln(reader, &serials[i])
	}

	sort.Slice(serials, func(i, j int) bool {
		if len(serials[i]) < len(serials[j]) {
			return true
		} else if len(serials[i]) == len(serials[j]) {
			var sumI, sumJ int
			for k := 0; k < len(serials[i]); k++ {
				if val, err := strconv.Atoi(string(serials[i][k])); err == nil {
					sumI += val
				}
				if val, err := strconv.Atoi(string(serials[j][k])); err == nil {
					sumJ += val
				}
			}
			if sumI < sumJ {
				return true
			} else if sumI == sumJ {
				return serials[i] < serials[j]
			}
			return false
		}
		return false
	})
	for i := 0; i < n; i++ {
		fmt.Fprintln(writer, serials[i])
	}
}

🎨 Python3

# https://www.acmicpc.net/problem/1431
import sys

if __name__ == "__main__":
    n = int(sys.stdin.readline())
    serials = []
    for i in range(n):
        serials.append(sys.stdin.readline().rstrip())
    serials = sorted(serials, key=lambda s: (len(s), sum([int(i) for i in s if type(i)== int or i.isdigit()]), s))
    for i in serials:
        print(i)