HDU 5804 Price List

Price List

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/131072 K (Java/Others)
Total Submission(s): 432    Accepted Submission(s): 277

Problem Description

There are n shops numbered with successive integers from 1 to n in Byteland. Every shop sells only one kind of goods, and the price of the i-th shop's goods is vi.

Every day, Byteasar will purchase some goods. He will buy at most one piece of goods from each shop. Of course, he can also choose to buy nothing. Back home, Byteasar will calculate the total amount of money he has costed that day and write it down on his account book.

However, due to Byteasar's poor math, he may calculate a wrong number. Byteasar would not mind if he wrote down a smaller number, because it seems that he hadn't used too much money.

Please write a program to help Byteasar judge whether each number is sure to be strictly larger than the actual value.

 

Input

The first line of the input contains an integer T (1≤T≤10), denoting the number of test cases.

In each test case, the first line of the input contains two integers n,m (1≤n,m≤100000), denoting the number of shops and the number of records on Byteasar's account book.

The second line of the input contains n integers v1,v2,...,vn (1≤vi≤100000), denoting the price of the i-th shop's goods.

Each of the next m lines contains an integer q (0≤q≤1018), denoting each number on Byteasar's account book.

 

Output

For each test case, print a line with m characters. If the i-th number is sure to be strictly larger than the actual value, then the i-th character should be '1'. Otherwise, it should be '0'.

 

Sample Input

13 32 5 41710000

 

Sample Output

001

 

Source

BestCoder Round #86

 

        注意数据大小！！！

     

#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<string>#include<queue>#include<stack>#include<climits>#include<set>#include<vector>#include<map>#include<algorithm>using namespace std;#define rep(i,j,k)for(i=j;i<k;i++)#define per(i,j,k)for(i=j;i>k;i--)#define MS(x,y)memset(x,y,sizeof(x))typedef long long LL;const int INF=0x7FFFFFFF;const int low(int x){return x&-1;}int main(){    LL t,n,m,i,j,k;    LL sum;    scanf("%lld",&t);    while(t--)    {        sum=0;        scanf("%lld%lld",&n,&m);        rep(i,0,n){        scanf("%lld",&k);          sum+=k;        }        rep(i,0,m){        scanf("%lld",&k);        if(k>sum)printf("1");        else printf("0");        }        printf("\n");    }    return 0;}