-
Notifications
You must be signed in to change notification settings - Fork 1
/
continuous_knapsack_problem.go
73 lines (58 loc) · 1.24 KB
/
continuous_knapsack_problem.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
package main
import (
"bufio"
"fmt"
"os"
"sort"
)
type knapsack struct {
cost int
weight int
}
func continuousKnapsackProblem(arr []knapsack, weight int) float64 {
sort.Slice(arr, func(i, j int) bool {
return arr[i].cost*arr[j].weight > arr[j].cost*arr[i].weight // nolint: gocritic
})
var sum float64
for i := range arr {
item := &arr[i]
if weight > item.weight {
sum += float64(item.cost)
weight -= item.weight
} else {
sum += float64(weight*item.cost) / float64(item.weight)
break
}
}
return sum
}
func main() {
stdin, err := os.Open(os.Getenv("INPUT_PATH"))
if err != nil {
stdin = os.Stdin
}
defer stdin.Close()
stdout, err := os.Create(os.Getenv("OUTPUT_PATH"))
if err != nil {
stdout = os.Stdout
}
defer stdout.Close()
reader := bufio.NewReaderSize(stdin, 1024*1024)
writer := bufio.NewWriterSize(stdout, 1024*1024)
var n, weight int
_, err = fmt.Fscan(reader, &n, &weight)
checkError(err)
arr := make([]knapsack, n)
for i := 0; i < n; i++ {
_, err = fmt.Fscan(reader, &arr[i].cost, &arr[i].weight)
checkError(err)
}
result := continuousKnapsackProblem(arr, weight)
fmt.Fprintf(writer, "%0.3f", result)
writer.Flush()
}
func checkError(err error) {
if err != nil {
panic(err)
}
}