package main import ( "bufio" "fmt" "os" "sort" "strconv" ) var sc = bufio.NewScanner(os.Stdin) var wr = bufio.NewWriter(os.Stdout) func out(x ...interface{}) { fmt.Fprintln(wr, x...) } func getI() int { sc.Scan() i, e := strconv.Atoi(sc.Text()) if e != nil { panic(e) } return i } func getF() float64 { sc.Scan() i, e := strconv.ParseFloat(sc.Text(), 64) if e != nil { panic(e) } return i } func getInts(N int) []int { ret := make([]int, N) for i := 0; i < N; i++ { ret[i] = getI() } return ret } func getS() string { sc.Scan() return sc.Text() } // min, max, asub, absなど基本関数 func max(a, b int) int { if a > b { return a } return b } func min(a, b int) int { if a < b { return a } return b } // min for n entry func nmin(a ...int) int { ret := a[0] for _, e := range a { ret = min(ret, e) } return ret } // max for n entry func nmax(a ...int) int { ret := a[0] for _, e := range a { ret = max(ret, e) } return ret } func asub(a, b int) int { if a > b { return a - b } return b - a } func abs(a int) int { if a >= 0 { return a } return -a } func lowerBound(a []int, x int) int { idx := sort.Search(len(a), func(i int) bool { return a[i] >= x }) return idx } func upperBound(a []int, x int) int { idx := sort.Search(len(a), func(i int) bool { return a[i] > x }) return idx } func main() { defer wr.Flush() sc.Split(bufio.ScanWords) sc.Buffer([]byte{}, 1000000) // this template is new version. // use getI(), getS(), getInts(), getF() N := getI() v := make([]int, N) w := make([]int, N) for i := 0; i < N; i++ { v[i], w[i] = getI(), getI() } V := getI() dp := make([][]int, N+1) for i := 0; i < N+1; i++ { dp[i] = make([]int, 110000) } for i := 0; i < N; i++ { for j := 110000 - 1; j >= 0; j-- { if j-w[i] >= 0 { dp[i+1][j] = max(dp[i][j], dp[i][j-w[i]]+v[i]) } else { dp[i+1][j] = dp[i][j] } } // out(dp[i+1][:20]) } l := lowerBound(dp[N], V) r := upperBound(dp[N], V) if l == 0 { l = 1 } out(l) if r == 110000 { out("inf") } else { out(r - 1) } }