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 v![]()
i![]()
![]()
.
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.
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 v![]()
1![]()
,v![]()
2![]()
,...,v![]()
n![]()
![]()
(1≤v![]()
i![]()
≤100000)![]()
, denoting the price of the i![]()
-th shop's goods.
Each of the next m![]()
lines contains an integer q![]()
(0≤q≤10![]()
18![]()
)![]()
, denoting each number on Byteasar's account book.
In each test case, the first line of the input contains two integers n,m
The second line of the input contains n
Each of the next m
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
唉，昨晚只做出来一个题。
代码：
#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; }
