HDU 5804 Price List

只需和总和比较即可。

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<iostream>
using namespace std;
typedef long long LL;
const double pi=acos(-1.0),eps=1e-8;
void File()
{
    freopen("D:\\in.txt","r",stdin);
    freopen("D:\\out.txt","w",stdout);
}
inline int read()
{
    char c = getchar();  while(!isdigit(c)) c = getchar();
    int x = 0;
    while(isdigit(c)) { x = x * 10 + c - ‘0‘; c = getchar(); }
    return x;
}

int T,n,m,b;

int main()
{
    scanf("%d", &T);
    while (T--)
    {
        scanf("%d%d", &n, &m);
        LL sum = 0;
        for(int i=1;i<=n;i++)
        {
            LL b;
            scanf("%I64d", &b);
            sum=sum+b;
        }
        while (m--)
        {
            LL x;
            scanf("%I64d", &x);
            if(x>sum) printf("1");
            else printf("0");
        }
        printf("\n");
    }
    return 0;
}