codeforces 706 B
来源:互联网 发布:怎样恢复内存卡数据 编辑:程序博客网 时间:2024/05/16 11:44
Description
Vasiliy likes to rest after a hard work, so you may often meet him in some bar nearby. As all programmers do, he loves the famous drink "Beecola", which can be bought in n different shops in the city. It's known that the price of one bottle in the shop i is equal to xi coins.
Vasiliy plans to buy his favorite drink for q consecutive days. He knows, that on the i-th day he will be able to spent mi coins. Now, for each of the days he want to know in how many different shops he can buy a bottle of "Beecola".
Input
The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the number of shops in the city that sell Vasiliy's favourite drink.
The second line contains n integers xi (1 ≤ xi ≤ 100 000) — prices of the bottles of the drink in the i-th shop.
The third line contains a single integer q (1 ≤ q ≤ 100 000) — the number of days Vasiliy plans to buy the drink.
Then follow q lines each containing one integer mi (1 ≤ mi ≤ 109) — the number of coins Vasiliy can spent on the i-th day.
Output
Print q integers. The i-th of them should be equal to the number of shops where Vasiliy will be able to buy a bottle of the drink on the i-th day.
Sample Input
53 10 8 6 114110311
0415
Hint
On the first day, Vasiliy won't be able to buy a drink in any of the shops.
On the second day, Vasiliy can buy a drink in the shops 1, 2, 3 and 4.
On the third day, Vasiliy can buy a drink only in the shop number 1.
Finally, on the last day Vasiliy can buy a drink in any shop.
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int a[100010];int main(){int n,m;while(scanf("%d",&n)!=EOF){for(int i=1;i<=n;i++)scanf("%d",&a[i]);sort(a+1,a+n+1);scanf("%d",&m);while(m--){int l=1,r=n;int x;scanf("%d",&x);while(r!=l){int mid=(l+r)/2;if(x>=a[mid])l=mid+1;elser=mid;}if(a[l]>x){l--;}printf("%d\n",l);}}}
- codeforces 706 B
- codeforces 706B B. Interesting drink (二分)
- CodeForces 706B Interesting drink
- CodeForces 706B Interesting drink
- 【codeforces 706B Interesting drink】
- CodeForces-706B. Interesting drink
- CodeForces 706B (二分)
- codeforces 706B Interesting drink
- codeforces B
- codeforces B
- codeforces B
- codeforces B
- 【Codeforces】-706B-Interesting drink(二分)
- 【二分】Codeforces 706B Interesting drink
- 【codeforces】706B—Interesting drink
- Codeforces 706B Interesting drink 【二分】
- CodeForces 706B Interesting drink【水题】
- CodeForces 626B CodeForces 626B【暴力】
- C++ typedef用法小结 (※不能不看※)
- mac下配置进行c和matlab混编
- [绍棠] 详说CMDeviceMotion
- Highcharts数据提示框动态显示非x轴非y轴数据
- 算法策略总结
- codeforces 706 B
- SLAM资源
- oracle,plsql导出数据库中的表
- Java静态导入
- 数据结构实验之查找七:线性之哈希表
- 易语言获取IP地址
- linux 操作系统下面都是什么文件?
- 点对点通信解决透明传输的方法
- POJ - 1222 EXTENDED LIGHTS OUT高斯消元