Problem:
Score : 300 points

Problem Statement

A programming competition site AtCode provides algorithmic problems.
Each problem is allocated a score based on its difficulty.
Currently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points.
These p_1 + … + p_D problems are all of the problems available on AtCode.

A user of AtCode has a value called total score.
The total score of a user is the sum of the following two elements:

Base score: the sum of the scores of all problems solved by the user.

Perfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).

Takahashi, who is the new user of AtCode, has not solved any problem.
His objective is to have a total score of G or more points.
At least how many problems does he need to solve for this objective?

Constraints

1 ≤ D ≤ 10

1 ≤ p_i ≤ 100

100 ≤ c_i ≤ 10^6

100 ≤ G

All values in input are integers.

c_i and G are all multiples of 100.

It is possible to have a total score of G or more points.

Input

Input is given from Standard Input in the following format:

D G
p_1 c_1
:
p_D c_D

Output

Print the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).

Sample Input 1

2 700
3 500
5 800

Sample Output 1

3

In this case, there are three problems each with 100 points and five problems each with 200 points. The perfect bonus for solving all the 100-point problems is 500 points, and the perfect bonus for solving all the 200-point problems is 800 points. Takahashi's objective is to have a total score of 700 points or more.

One way to achieve this objective is to solve four 200-point problems and earn a base score of 800 points. However, if we solve three 100-point problems, we can earn the perfect bonus of 500 points in addition to the base score of 300 points, for a total score of 800 points, and we can achieve the objective with fewer problems.

Sample Input 2

2 2000
3 500
5 800

Sample Output 2

7

This case is similar to Sample Input 1, but the Takahashi's objective this time is 2000 points or more. In this case, we inevitably need to solve all five 200-point problems, and by solving two 100-point problems additionally we have the total score of 2000 points.

Sample Input 3

2 400
3 500
5 800

Sample Output 3

2

This case is again similar to Sample Input 1, but the Takahashi's objective this time is 400 points or more. In this case, we only need to solve two 200-point problems to achieve the objective.

Sample Input 4

5 25000
20 1000
40 1000
50 1000
30 1000
1 1000

Sample Output 4

66

There is only one 500-point problem, but the perfect bonus can be earned even in such a case.

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.List;
import java.util.Scanner;
import java.util.ArrayList;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ABC104_C solver = new ABC104_C();
        solver.solve(1, in, out);
        out.close();
    }

    static class ABC104_C {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            long goal = in.nextLong();

            int ans = Integer.MAX_VALUE;
            int[] problems = new int[n];
            long[] bonus = new long[n];
            Problem[] set = new Problem[n];
            for (int i = 0; i < n; i++) {
                problems[i] = in.nextInt();
                bonus[i] = in.nextLong();

                Problem pro = new Problem((i + 1) * 100, problems[i], bonus[i]);
                set[i] = pro;
            }

            List<List<Integer>> searchList = new ArrayList<List<Integer>>();


            searchList = getBinary(n);


            for (List<Integer> list : searchList) {
                long score = 0;
                int cnt = 0;
                int index = 0;
                for (Integer solve : list) {
                    if (solve == 1) {
                        score += set[index].perfect;
                        cnt += set[index].cnt;
                    }
                    index++;
                }

                if (score >= goal) {
                    ans = Math.min(ans, cnt);
                } else {
                    for (index = list.size() - 1; 0 <= index; index--) {
                        if (list.get(index) == 0) {
                            long sub = goal - score;
                            if (set[index].point * (set[index].cnt - 1) < sub) {
                                break;
                            } else {
                                cnt += sub / set[index].point;
                                if (sub % set[index].point != 0) {
                                    cnt++;
                                }
                                ans = Math.min(ans, cnt);
                                break;
                            }
                        }
                    }

                }


            }
            out.print(ans);

        }

        private List<List<Integer>> getBinary(int n) {

            if (n == 1) {
                List<List<Integer>> list = new ArrayList<List<Integer>>();
                List<Integer> addZero = new ArrayList<Integer>();
                List<Integer> addOne = new ArrayList<Integer>();

                addZero.add(0);
                addOne.add(1);

                list.add(addZero);
                list.add(addOne);

                return list;
            }

            List<List<Integer>> prev = getBinary(n - 1);
            List<List<Integer>> returnArray = new ArrayList<List<Integer>>(prev);
            for (List<Integer> array : prev) {
                List<Integer> addZero = new ArrayList<Integer>(array);
                List<Integer> addOne = new ArrayList<Integer>(array);

                addZero.add(0);
                addOne.add(1);

                returnArray.add(addZero);
                returnArray.add(addOne);

                returnArray.remove(array);
            }

            return returnArray;
        }

    }

    static class Problem {
        int point;
        int cnt;
        long bonus;
        long perfect;

        Problem(int point, int cnt, long bonus) {
            this.point = point;
            this.cnt = cnt;
            this.bonus = bonus;
            this.perfect = this.point * this.cnt + this.bonus;
        }

    }
}