309324: CF1662I. Ice Cream Shop

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Ice Cream Shop

题目描述

On a beach there are $ n $ huts in a perfect line, hut $ 1 $ being at the left and hut $ i+1 $ being $ 100 $ meters to the right of hut $ i $ , for all $ 1 \le i \le n - 1 $ . In hut $ i $ there are $ p_i $ people. There are $ m $ ice cream sellers, also aligned in a perfect line with all the huts. The $ i $ -th ice cream seller has their shop $ x_i $ meters to the right of the first hut. All ice cream shops are at distinct locations, but they may be at the same location as a hut. You want to open a new ice cream shop and you wonder what the best location for your shop is. You can place your ice cream shop anywhere on the beach (not necessarily at an integer distance from the first hut) as long as it is aligned with the huts and the other ice cream shops, even if there is already another ice cream shop or a hut at that location. You know that people would come to your shop only if it is strictly closer to their hut than any other ice cream shop. If every person living in the huts wants to buy exactly one ice cream, what is the maximum number of ice creams that you can sell if you place the shop optimally?

输入输出格式

输入格式


The first line contains two integers $ n $ and $ m $ ( $ 2 \le n \le 200\,000 $ , $ 1 \le m \le 200\,000 $ ) — the number of huts and the number of ice cream sellers. The second line contains $ n $ integers $ p_1, p_2, \ldots, p_n $ ( $ 1 \le p_i \le 10^9 $ ) — the number of people in each hut. The third line contains $ m $ integers $ x_1, x_2, \ldots, x_m $ ( $ 0 \le x_i \le 10^9 $ , $ x_i \ne x_j $ for $ i \ne j $ ) — the location of each ice cream shop.

输出格式


Print the maximum number of ice creams that can be sold by choosing optimally the location of the new shop.

输入输出样例

输入样例 #1

3 1
2 5 6
169

输出样例 #1

7

输入样例 #2

4 2
1 2 7 8
35 157

输出样例 #2

15

输入样例 #3

4 1
272203905 348354708 848256926 939404176
20

输出样例 #3

2136015810

输入样例 #4

3 2
1 1 1
300 99

输出样例 #4

2

说明

In the first sample, you can place the shop (coloured orange in the picture below) $ 150 $ meters to the right of the first hut (for example) so that it is the closest shop to the first two huts, which have $ 2 $ and $ 5 $ people, for a total of $ 7 $ sold ice creams. ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF1662I/036f11cf99e6ce8eb9e75f459ae556bcd19b83aa.png)In the second sample, you can place the shop $ 170 $ meters to the right of the first hut (for example) so that it is the closest shop to the last two huts, which have $ 7 $ and $ 8 $ people, for a total of $ 15 $ sold ice creams. ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF1662I/84a834b228612f15126bc0383c786ab5a307b489.png)

Input

题意翻译

### 题意 一条直线上有 $n$ 个小屋,第 $1$ 个小屋在所有点的最左端,第 $i+1$ 个小屋在第 $i$ 个小屋的右侧 $100m$ 处。($1\le i\le n-1$)每座小屋里有 $p_i$ 个人。 直线上另有 $m$ 个点与这 $n$ 个点在同一直线上,第 $i$ 个点在第一座小屋右侧 $x_i$ 米处。所有点的位置各不相同,但他们可能和小屋重合。 在直线上取一点(可以与其它点或小屋重合,位置可以为浮点数),使得它距离若干个小屋在所有点中最近。求这些距离最近小屋中人数之和的最大值。 ### 输入格式 第 $1$ 行,两个整数 $n$,$m$,含义如题。 第 $2$ 行,$n$ 个整数,表示 $p_i$。 第 $3$ 行,$m$ 个整数,表示 $x_i$。 ### 输出格式 仅 $1$ 行 $1$ 个正整数,表示人数的最大值。 $\text{Translated\space By\space Rebd\_Optem}$

加入题单

上一题 下一题 算法标签: