-
-
Notifications
You must be signed in to change notification settings - Fork 26
/
Copy pathtask.go
77 lines (64 loc) · 1.13 KB
/
task.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
68
69
70
71
72
73
74
75
76
77
package main
import (
"bufio"
"fmt"
"io"
"log"
"os"
"strconv"
"strings"
)
type Heap struct {
weight int
cap []int
}
func main() {
s := strings.Builder{}
Solution(os.Stdin, &s)
fmt.Println(s.String())
}
func Solution(r io.Reader, s *strings.Builder) {
scanner := bufio.NewScanner(r)
var err error
var arrStr []string
var n, m int
scanner.Scan()
arrStr = strings.Fields(scanner.Text())
n, err = strconv.Atoi(arrStr[0])
if err != nil {
log.Fatal(err)
}
m, err = strconv.Atoi(arrStr[1])
if err != nil {
log.Fatal(err)
}
scanner.Scan()
arrStr = strings.Fields(scanner.Text())
previous := Heap{
weight: 0,
cap: make([]int, m+1),
}
var goldHeap Heap
for i := 0; i < n; i++ {
weight, _ := strconv.Atoi(arrStr[i])
goldHeap = Heap{
weight: weight,
cap: make([]int, m+1),
}
for g := 0; g < m+1; g++ {
if g-weight >= 0 {
goldHeap.cap[g] = max(previous.cap[g], weight+previous.cap[g-weight])
} else {
goldHeap.cap[g] = previous.cap[g]
}
}
previous = goldHeap
}
s.WriteString(fmt.Sprint(goldHeap.cap[m]))
}
func max(a, b int) int {
if a > b {
return a
}
return b
}