루미 알고리즘

#1538플래티넘Burning Trees

PO 2022 훈련 캠프코딩출제 Nils Gustafsson, Abdullah Zaghmout영어 원문이 문제가 어렵다면 — 배우는 순서 보기

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

Problem

A forest fire has broken out in a nature reserve. In the area, there is a rare species of tree that cannot be found anywhere else in the world. You are in the forest, and on your way home, you intend to save as many trees as possible.

There are N rare trees numbered from 1 to N, and you will run past them in that order. It takes A_i seconds for you to save the i-th tree, but you must start saving it by second X_i, otherwise, the tree will burn up. However, it doesn't matter if second X_i occurs while you are in the process of saving the tree.

Running between the trees takes no time at all for you, but you can only run forward and therefore can only save trees in the order that you visit them. However, you know that

X_1 ≤ X_2 ≤ X_3 ≤ … ≤ X_N

Find the maximum number of trees you can save.

Input

The first line contains an integer N (1 ≤ N ≤ 4 · 10^5), the number of trees.

The second line contains N integers X_i (0 ≤ X_i ≤ 10^9), the latest second by which you must start saving the i-th tree.

The third line contains N integers A_i (1 ≤ A_i ≤ 10^9), the time it takes to save the i-th tree.

Output

Print a single integer, the maximum number of trees that can be saved.

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
110A_1 = A_2 = … = A_N
218X_1 = X_2 = … = X_N
315N, A_i, X_i ≤ 100
422N ≤ 2000
535No additional constraints.

예제

예제 1

입력
6
1 1 2 2 5 8
2 3 3 5 2 2
출력
4

예제 2

입력
5
0 0 1 2 3
5 1 1 1 1
출력
4

예제 3

입력
3
5 5 5
6 1 1
출력
2

출처 표기

출처: Programmeringsolympiaden 2022년 훈련 캠프 · 원문 페이지 · 이용 조건 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). 루미 알고리즘은 위 단체들과 관계없는 별도의 서비스이며, 자료는 원문 그대로 싣습니다. 문제마다 출처와 이용 조건을 따로 표기합니다.