hdu-5804 Price List(水题)
题目链接:
Price List
Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 262144/131072 K (Java/Others)
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.
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.
3 3
2 5 4
1
7
10000
/************************************************
┆ ┏┓ ┏┓ ┆
┆┏┛┻━━━┛┻┓ ┆
┆┃ ┃ ┆
┆┃ ━ ┃ ┆
┆┃ ┳┛ ┗┳ ┃ ┆
┆┃ ┃ ┆
┆┃ ┻ ┃ ┆
┆┗━┓ ┏━┛ ┆
┆ ┃ ┃ ┆
┆ ┃ ┗━━━┓ ┆
┆ ┃ AC代马 ┣┓┆
┆ ┃ ┏┛┆
┆ ┗┓┓┏━┳┓┏┛ ┆
┆ ┃┫┫ ┃┫┫ ┆
┆ ┗┻┛ ┗┻┛ ┆
************************************************ */ #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
//#include <bits/stdc++.h>
#include <stack> using namespace std; #define For(i,j,n) for(int i=j;i<=n;i++)
#define mst(ss,b) memset(ss,b,sizeof(ss)); typedef long long LL; template<class T> void read(T&num) {
char CH; bool F=false;
for(CH=getchar();CH<'0'||CH>'9';F= CH=='-',CH=getchar());
for(num=0;CH>='0'&&CH<='9';num=num*10+CH-'0',CH=getchar());
F && (num=-num);
}
int stk[70], tp;
template<class T> inline void print(T p) {
if(!p) { puts("0"); return; }
while(p) stk[++ tp] = p%10, p/=10;
while(tp) putchar(stk[tp--] + '0');
putchar('\n');
} const LL mod=1e9+7;
const double PI=acos(-1.0);
const int inf=1e9;
const int N=1e6+10;
const int maxn=2e3+14;
const double eps=1e-12; int main()
{
int t;
read(t);
while(t--)
{
int n,m,x,mmax=0;
LL sum=0,temp;
read(n);read(m);
For(i,1,n)read(x),sum=sum+x;
//sort(a+1,a+n+1);
while(m--)
{
read(temp);
if(temp>sum)printf("1");
else printf("0");
}
printf("\n");
}
return 0;
}
最新文章
- 0-1背包问题蛮力法求解(java版本)
- Flipping Bits in Memory Without Accessing Them: An Experimental Study of DRAM Disturbance Errors
- Python之路【第八篇】python实现线程池
- java 链接jdbc
- robotframework笔记8
- std::vector<;Channel2*>; m_allChannels;容器,以及如何根据channelid的意义
- SQL Server 2008 备份改进版
- VI使用的小白教程
- CAS认证(3):验证用户信息
- js时间基本操作
- .NET一个线程更新另一个线程的UI(两种实现方法及若干简化)
- xcode-build/version-bump
- Duanxx的Altium Designer学习:PCB试想一下,在目前的水平
- JS 禁止右键,禁止复制,禁止粘贴
- Loadrunner Http接口Get/Post方法性能测试脚本解析
- Tomcat下载,新建自己的项目,模拟server
- Node.js框架 —— Express
- Ambari大数据的管理利器
- 支持“XXX”上下文的模型已在数据库创建后发生更改。请考虑使用 Code First 迁移更新数据库(http://go.microsoft.com/fwlink/?LinkId=238269)。
- python 去除html 超链接href 如何实现?