package main import . "fmt" import . "sort" func main() { var n, m int Scan(&n,&m) type X struct { v,w int } xs := make([]*X, 0, n) for i := 0; i < n; i++ { x := new(X) Scan(&x.v, &x.w) if x.w <= m { xs = append(xs, x) } } Slice(xs, func(i, j int) bool { return xs[i].v > xs[j].v }) ans := 0 type Y struct { sum int } kn := make([]*Y, m+1) for _, x := range xs { for i := m; i >= 0; i-- { if kn[i] == nil || i+x.w > m { continue } y := &Y{ kn[i].sum+x.v } if z := kn[i+x.w]; z == nil || y.sum > z.sum { ans = max(ans, x.v * y.sum) kn[i+x.w] = y } } yy := &Y{ x.v } if z := kn[x.w]; z == nil || yy.sum > z.sum { ans = max(ans, x.v * yy.sum) kn[x.w] = yy } } Println(ans) }