/
d.go
67 lines (57 loc) · 1.11 KB
/
d.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
package main
import (
"fmt"
"io"
"os"
"sort"
)
func fscanNums(r io.Reader, len int) (nums []int) {
var num int
for i := 0; i < len; i++ {
fmt.Fscan(r, &num)
nums = append(nums, num)
}
return
}
func max(a, b int) int {
if a > b {
return a
}
return b
}
func answer(r io.Reader, w io.Writer) {
msSizes := []int{0, 2, 5, 5, 4, 5, 6, 3, 7, 6}
var numMS int
var numDigits int
fmt.Fscan(r, &numMS)
fmt.Fscan(r, &numDigits)
nums := fscanNums(r, numDigits)
sort.Sort(sort.Reverse(sort.IntSlice(nums)))
dp := make([]int, numMS+1)
dp[0] = 0
for i := 1; i <= numMS; i++ {
maxDigit := -1
for j := 0; j < numDigits; j++ {
index := i - msSizes[nums[j]]
if index >= 0 && dp[index] >= 0 {
maxDigit = max(maxDigit, dp[index]+1)
}
}
dp[i] = maxDigit
}
remain := numMS
for remain > 0 {
maxDigit := -1
for j := 0; j < numDigits; j++ {
index := remain - msSizes[nums[j]]
if index >= 0 && dp[index] == dp[remain]-1 {
maxDigit = max(maxDigit, nums[j])
}
}
remain = remain - msSizes[maxDigit]
fmt.Fprintf(w, "%v", maxDigit)
}
}
func main() {
answer(os.Stdin, os.Stdout)
}