-
Notifications
You must be signed in to change notification settings - Fork 28
/
Copy path11389.go
42 lines (37 loc) · 788 Bytes
/
11389.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
// UVa 11389 - The Bus Driver Problem
package main
import (
"fmt"
"os"
"sort"
)
func solve(d, r int, morning, evening []int) int {
sort.Ints(morning)
sort.Sort(sort.Reverse(sort.IntSlice(evening)))
var amount int
for i := range morning {
amount += (morning[i] + evening[i] - d) * r
}
return amount
}
func main() {
in, _ := os.Open("11389.in")
defer in.Close()
out, _ := os.Create("11389.out")
defer out.Close()
var n, d, r int
for {
if fmt.Fscanf(in, "%d%d%d", &n, &d, &r); n == 0 && d == 0 && r == 0 {
break
}
morning := make([]int, n)
for i := range morning {
fmt.Fscanf(in, "%d", &morning[i])
}
evening := make([]int, n)
for i := range evening {
fmt.Fscanf(in, "%d", &evening[i])
}
fmt.Fprintln(out, solve(d, r, morning, evening))
}
}