Price List

Price List

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


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 (1T10) , denoting the number of test cases.

In each test case, the first line of the input contains two integers n,m (1n,m100000) , 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 (1vi100000) , denoting the price of the i -th shop's goods.

Each of the next m lines contains an integer q (0q1018) , 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
1 3 3 2 5 4 1 7 10000
 

 

Sample Output
001
 

 

Source
 

 

Recommend
wange2014   |   We have carefully selected several similar problems for you:   5808  5807  5806  5805  5804 
 
唉,昨晚只做出来一个题。
 
代码:
#include <iostream>
#include <cstdio>

using namespace std;

int main()
{
    int t;
    int n,m;
    int v=0;;
    int sum=0;
    int jilu[100005];
    int jieguo[100005];
    scanf("%d",&t);
    while(t--){
        sum=0;
        scanf("%d %d",&n,&m);
        for(int i=0;i<n;i++){
            scanf("%d",&v);
            sum+=v;
        }
        for(int j=0;j<m;j++){
            scanf("%d",&jilu[j]);
        }
        for(int j=0;j<m;j++){
            if(jilu[j]>sum){
                printf("1");
            }else{
                printf("0");
            }
        }
        printf("\n");


    }
    return 0;
}

 

全部评论

相关推荐

xtu大迫杰:偶遇校友,祝校友offer打牌
点赞 评论 收藏
分享
评论
点赞
收藏
分享

创作者周榜

更多
正在热议
更多
# 春招至今,你的战绩如何? #
10789次浏览 93人参与
# 你的实习产出是真实的还是包装的? #
1925次浏览 42人参与
# 巨人网络春招 #
11351次浏览 223人参与
# 军工所铁饭碗 vs 互联网高薪资,你会选谁 #
7595次浏览 43人参与
# 简历第一个项目做什么 #
31715次浏览 338人参与
# 重来一次,我还会选择这个专业吗 #
433485次浏览 3926人参与
# MiniMax求职进展汇总 #
24068次浏览 309人参与
# 当下环境,你会继续卷互联网,还是看其他行业机会 #
187157次浏览 1122人参与
# 牛客AI文生图 #
21442次浏览 238人参与
# 不考虑薪资和职业,你最想做什么工作呢? #
152396次浏览 888人参与
# 研究所笔面经互助 #
118934次浏览 577人参与
# 简历中的项目经历要怎么写? #
310271次浏览 4216人参与
# AI时代,哪些岗位最容易被淘汰 #
63684次浏览 825人参与
# 面试紧张时你会有什么表现? #
30507次浏览 188人参与
# 你今年的平均薪资是多少? #
213095次浏览 1039人参与
# 你怎么看待AI面试 #
180063次浏览 1256人参与
# 高学历就一定能找到好工作吗? #
64328次浏览 620人参与
# 你最满意的offer薪资是哪家公司? #
76504次浏览 374人参与
# 我的求职精神状态 #
448056次浏览 3129人参与
# 正在春招的你,也参与了去年秋招吗? #
363419次浏览 2638人参与
# 腾讯音乐求职进展汇总 #
160651次浏览 1112人参与
# 校招笔试 #
470997次浏览 2964人参与
牛客网
牛客网在线编程
牛客网题解
牛客企业服务