/
P13904.go
78 lines (62 loc) · 1.14 KB
/
P13904.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
78
// Greedy, Sorting
// https://www.acmicpc.net/problem/13904
package main
import (
"bufio"
"fmt"
"os"
"sort"
"strconv"
)
var sc *bufio.Scanner = bufio.NewScanner(os.Stdin)
var bw *bufio.Writer = bufio.NewWriter(os.Stdout)
type Work struct {
dday int
point int
}
func Fn() {
N := scanInt()
WorkSlice := make([]Work, 1005)
schedule := make([]int, 1005)
for i := 0; i < N; i++ {
d, w := scanInt(), scanInt()
WorkSlice = append(WorkSlice, Work{dday: d, point: w})
}
sort.Slice(WorkSlice, func(i, j int) bool {
return WorkSlice[i].point > WorkSlice[j].point
})
for i := 0; i < N; i++ {
curWork := WorkSlice[i]
curDday := curWork.dday
curPoint := curWork.point
if schedule[curDday] == 0 {
schedule[curDday] = curPoint
} else {
for {
if curDday == 1 {
break
}
curDday--
if schedule[curDday] == 0 {
schedule[curDday] = curPoint
break
}
}
}
}
sum := 0
for i := 0; i < len(schedule); i++ {
sum += schedule[i]
}
fmt.Println(sum)
}
func main() {
defer bw.Flush()
sc.Split(bufio.ScanWords)
Fn()
}
func scanInt() int {
sc.Scan()
v, _ := strconv.Atoi(sc.Text())
return v
}