当前位置:网站首页>Interesting drink
Interesting drink
2022-07-06 16:02:00 【It's Xiao Zhang, ZSY】
Interesting drink
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.
Example
Input
5
3 10 8 6 11
4
1
10
3
11
Output
0
4
1
5
Note
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.
10 Of 5 The next power , Must think of two points
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
#define INF 0x3f3f3f3f
int n,dis[100000],f,k;
bool book[2001];
char c[2001][2001];
int main()
{
cin>>n;
for(int i=0;i<n;i++)
cin>>dis[i];
sort(dis,dis+n);
cin>>f;
for(int i=1;i<=f;i++)
{
cin>>k;
int mid=upper_bound(dis,dis+n,k)-dis;
cout<<mid<<endl;
}
return 0;
}
harm , I haven't used two point search for a long time and forgot
Split template
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
#define INF 0x3f3f3f3f
int n,dis[100009],f,k;
bool book[2001];
char c[2001][2001];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>dis[i];
sort(dis+1,dis+1+n);
cin>>f;
for(int i=1;i<=f;i++)
{
cin>>k;
int l=1,r=n;
int mid;
while(l<=r)
{
mid=(r+l)/2;
if(dis[mid]>k)
r=mid-1;
else
l=mid+1;
//cout<<l<<r<<mid<<endl;
}
cout<<l-1<<endl;
}
return 0;
}
边栏推荐
- 【练习-7】Crossword Answers
- Research Report on market supply and demand and strategy of China's land incineration plant industry
- 【练习-1】(Uva 673) Parentheses Balance/平衡的括号 (栈stack)
- Research Report of cylindrical grinder industry - market status analysis and development prospect forecast
- Opencv learning log 33 Gaussian mean filtering
- Record of brushing questions with force deduction -- complete knapsack problem (I)
- [exercise-9] Zombie's Treasury test
- China's earthwork tire market trend report, technical dynamic innovation and market forecast
- Research Report of exterior wall insulation system (ewis) industry - market status analysis and development prospect prediction
- Information security - security professional name | CVE | rce | POC | Vul | 0day
猜你喜欢
Information security - threat detection engine - common rule engine base performance comparison
D - Function(HDU - 6546)女生赛
信息安全-威胁检测-flink广播流BroadcastState双流合并应用在过滤安全日志
C语言是低级和高级的分水岭
7-1 懂的都懂 (20 分)
[analysis of teacher Gao's software needs] collection of exercises and answers for level 20 cloud class
信息安全-史诗级漏洞Log4j的漏洞机理和防范措施
b站 實時彈幕和曆史彈幕 Protobuf 格式解析
C语言数组的概念
渗透测试 ( 8 ) --- Burp Suite Pro 官方文档
随机推荐
b站 實時彈幕和曆史彈幕 Protobuf 格式解析
JS调用摄像头
洛谷P1102 A-B数对(二分,map,双指针)
Flink 使用之 CEP
0-1背包問題(一)
Research Report on market supply and demand and strategy of Chinese graphic screen printing equipment industry
Opencv learning log 16 paperclip count
[exercise-4] (UVA 11988) broken keyboard = = (linked list)
【练习-6】(PTA)分而治之
信息安全-史诗级漏洞Log4j的漏洞机理和防范措施
Essai de pénétration (1) - - outils nécessaires, navigation
C语言是低级和高级的分水岭
frida hook so层、protobuf 数据解析
Research Report on shell heater industry - market status analysis and development prospect forecast
【练习-6】(Uva 725)Division(除法)== 暴力
渗透测试 ( 4 ) --- Meterpreter 命令详解
Record of force deduction and question brushing
滲透測試 ( 1 ) --- 必備 工具、導航
Nodejs+vue网上鲜花店销售信息系统express+mysql
1010 things that college students majoring in it must do before graduation