루미 알고리즘

#1598실버Pickle Clicker

PO 2024 학교 예선코딩출제 Joshua Andersson영어 원문이 문제가 어렵다면 — 배우는 순서 보기

영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)

Problem

Approximately six months ago, the critically acclaimed game Pickle Clicker was released. After spending countless hours on the game, Rasmus has decided to take things to the next level: he plans to speedrun the game.

The goal of Pickle Clicker is to collect as much of the currency pickles as possible. The goal in a speedrun is to purchase the Megapickle as quickly as possible, which costs T pickles. In the game, there are also N different types of buildings. The various types are numbered from 1 to N, where the i-th type produces p_i pickles per second and costs c_i pickles to build.

At the start, you own a building of type 1. Every second, the following events occur:

  1. Every building you own produces pickles. A building of type i produces p_i pickles.
  2. Afterwards, you have the option to buy a building or buy the Megapickle. A building of type i costs c_i pickles to build, and you must afford it to be able to buy it. You can buy a maximum of one building per second, and it is allowed to have multiple buildings of the same type.

Help Rasmus determine how to play the game so that he can purchase the Megapickle in as few seconds as possible. See the example below to get a clearer understanding of the rules.

Input

The first line of input contains the integers N and T (1 ≤ N ≤ 6, 1 ≤ T ≤ 10^5), the number of buildings and the cost of the Megapickle.

The following N lines each contain the integers p_i, c_i (1 ≤ p_i, c_i ≤ T), describing the production speed and cost of the i-th building type.

Output

Print an integer: the number of seconds it takes to win Pickle Clicker if you play optimally.

Scoring

Your solution will be tested on a set of test groups, each worth a number of points. Each test group contains a set of test cases. To get the points for a test group you need to solve all test cases in the test group.

GroupPointsConstraints
120N=1
220T ≤ 10
320T ≤ 1000
440No additional constraints.

Sample explanation

(그림은 원문 저장소에서 볼 수 있습니다)

The image shows the solution to sample 1. The first row describes which buildings we own at the start of the corresponding second. The second row is how many pickles we have after the buildings have produced. The last row indicates whether we bought something at the end of the second.

예제

예제 1

입력
2 100
3 3
50 10
출력
5

예제 2

입력
1 100000
1 1000
출력
6179

출처 표기

출처: Programmeringsolympiaden 2024년 학교 예선 · 원문 페이지 · 이용 조건 CC BY-SA · LaTeX 원문을 화면용 글로 옮겼습니다(수식·표의 모양이 다를 수 있습니다). 내용은 고치지 않았습니다.

크리에이티브 커먼즈 저작자표시-동일조건변경허락.

문제 출처: 한국정보올림피아드(KOI) (CC BY-NC-SA 4.0) · International Olympiad in Informatics (IOI) (CC BY) · Centre for Education in Mathematics and Computing (CEMC), University of Waterloo (CC BY-NC 4.0) · Programmeringsolympiaden (CC BY-SA) · CSES Problem Set (Antti Laaksonen) (CC BY-NC-SA 4.0). 루미 알고리즘은 위 단체들과 관계없는 별도의 서비스이며, 자료는 원문 그대로 싣습니다. 문제마다 출처와 이용 조건을 따로 표기합니다.