2021.3.10--vj补题

B - Saving the City

cf--1443B

Bertown is a city with $n$

The city's security service discovered that some buildings were mined. A map was compiled, which is a string of length $n$

Bertown's best sapper knows how to activate mines so that the buildings above them are not damaged. When a mine under the building numbered $x$

Also, a sapper can place a mine under a building if it wasn't there. For such an operation, he takes $b$

The sapper can carry out operations in any order.

You want to blow up all the mines in the city to make it safe. Find the minimum number of coins that the sapper will have to pay so that after his actions there are no mines left in the city.

Input

The first line contains one positive integer $t$

Each test case begins with a line containing two integers $a$

The next line contains a map of mines in the city — a string consisting of zeros and ones.

The sum of the string lengths for all test cases does not exceed $10^{5}$

Output

For each test case, output one integer — the minimum number of coins that the sapper will have to pay.

Example

Input

Output

2
6

Note

In the second test case, if we place a mine under the fourth building and then activate it, then all mines on the field are activated. The cost of such operations is six, $b = 1$

$b = 1$

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int a,b;
        cin>>a>>b;
        getchar();
        string s;
        cin>>s;
        int x[100005]={0};
        int m=s.size(),k=0;
        for(int i=0;i<m;i++)
        {
            if(s[i]=='1')
            {
                x[k++]=i;
            }
        }
        if(k==0)cout<<"0"<<endl;
        else{
            int sum=a;
            for(int i=0;i<k-1;i++)
            {
                if(x[i+1]-x[i]<=1)
                    continue;
                else
                    sum+=min((x[i+1]-x[i]-1)*b,a);
            }
            cout<<sum<<endl;
        }

    }
}

C - The Delivery Dilemma

cf--1443C

Petya is preparing for his birthday. He decided that there would be $n$ different dishes on the dinner table, numbered from $1$ to $n$ . Since Petya doesn't like to cook, he wants to order these dishes in restaurants.

Unfortunately, all dishes are prepared in different restaurants and therefore Petya needs to pick up his orders from $n$ different places. To speed up this process, he wants to order courier delivery at some restaurants. Thus, for each dish, there are two options for Petya how he can get it:

the dish will be delivered by a courier from the restaurant $i$ , in this case the courier will arrive in $a_{i}$ minutes,
Petya goes to the restaurant $i$ on his own and picks up the dish, he will spend $b_{i}$ minutes on this.

Each restaurant has its own couriers and they start delivering the order at the moment Petya leaves the house. In other words, all couriers work in parallel. Petya must visit all restaurants in which he has not chosen delivery, he does this consistently.

For example, if Petya wants to order $n = 4$ dishes and $a = [3, 7, 4, 5]$ , and $b = [2, 1, 2, 4]$ , then he can order delivery from the first and the fourth restaurant, and go to the second and third on your own. Then the courier of the first restaurant will bring the order in $3$ minutes, the courier of the fourth restaurant will bring the order in $5$ minutes, and Petya will pick up the remaining dishes in $1 + 2 = 3$ minutes. Thus, in $5$ minutes all the dishes will be at Petya's house.

Find the minimum time after which all the dishes can be at Petya's home.

Input

The first line contains one positive integer $t$ ( $1 \leq t \leq 2 \cdot 10^{5}$ ) — the number of test cases. Then $t$ test cases follow.

Each test case begins with a line containing one integer $n$ ( $1 \leq n \leq 2 \cdot 10^{5}$ ) — the number of dishes that Petya wants to order.

The second line of each test case contains $n$ integers $a_{1} \dots a_{n}$ ( $1 \leq a_{i} \leq 10^{9}$ ) — the time of courier delivery of the dish with the number $i$ .

The third line of each test case contains $n$ integers $b_{1} \dots b_{n}$ ( $1 \leq b_{i} \leq 10^{9}$ ) — the time during which Petya will pick up the dish with the number $i$ .

The sum of $n$ over all test cases does not exceed $2 \cdot 10^{5}$ .

Output

For each test case output one integer — the minimum time after which all dishes can be at Petya's home.

Example

Input

Output

题意：

要点有n个菜，点外卖或者自己去拿，点外卖需时间ai，自己拿需 bi,求最短时间

思路：

二分法。记下自己去拿菜的总时间，二分，如果 ai 时间<mid ，就点外卖，>mid，就自己去拿, 然后自己去拿的时间再和mid 比较

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+100;
ll a[N],b[N];
ll n;
bool show(ll x)
{
    ll sum=0;
    for(int i=0;i<n;i++)
    {
        if(a[i]>x)
        {
            sum+=b[i];
        }
    }
    return sum<=x;
}
int main()
{
    ll t;
    cin>>t;
    while(t--)
    {
        cin>>n;
        for(int i=0;i<n;i++)
        {
            cin>>a[i];
        }
        ll l=0,r=0;
        for(int j=0;j<n;j++)
        {
            cin>>b[j];
            r+=b[j];
        }
        while(l<r)
        {
            ll mid=(l+r)/2;
            if(show(mid)==1)r=mid;
            else l=mid+1;
        }
        cout<<r<<endl;
    }
}

the dish will be delivered by a courier from the restaurant $i$ , in this case the courier will arrive in $a_{i}$ minutes,
Petya goes to the restaurant $i$ on his own and picks up the dish, he will spend $b_{i}$ minutes on this.

Find the minimum time after which all the dishes can be at Petya's home.

Input

The first line contains one positive integer $t$ ( $1 \leq t \leq 2 \cdot 10^{5}$ ) — the number of test cases. Then $t$ test cases follow.

Each test case begins with a line containing one integer $n$ ( $1 \leq n \leq 2 \cdot 10^{5}$ ) — the number of dishes that Petya wants to order.

The second line of each test case contains $n$ integers $a_{1} \dots a_{n}$ ( $1 \leq a_{i} \leq 10^{9}$ ) — the time of courier delivery of the dish with the number $i$ .

The third line of each test case contains $n$ integers $b_{1} \dots b_{n}$ ( $1 \leq b_{i} \leq 10^{9}$ ) — the time during which Petya will pick up the dish with the number $i$ .

The sum of $n$ over all test cases does not exceed $2 \cdot 10^{5}$ .

Output

For each test case output one integer — the minimum time after which all dishes can be at Petya's home.

Example

Input

Output

posted @ 2021-03-14 20:37 西瓜0 阅读(120) 评论(0) 收藏举报

刷新页面返回顶部

西瓜0

2021.3.10--vj补题

B - Saving the City

公告