Codeforces 600B Queries about less or equal elements(二分、upper_bound()的应用)
来源:互联网 发布:阿里云合作公司有哪些 编辑:程序博客网 时间:2024/06/05 03:36
Queries about less or equal elements
You are given two arrays of integers a and b. For each element of the second array bj you should find the number of elements in array a that are less than or equal to the value bj.
Input
The first line contains two integers n, m (1 ≤ n, m ≤ 2·105) — the sizes of arrays a and b.
The second line contains n integers — the elements of array a ( - 109 ≤ ai ≤ 109).
The third line contains m integers — the elements of array b ( - 109 ≤ bj ≤ 109).
Output
Print m integers, separated by spaces: the j-th of which is equal to the number of such elements in array a that are less than or equal to the value bj.
Example
Input
5 4
1 3 5 7 9
6 4 2 8
Output
3 2 1 4
Input
5 5
1 2 1 2 5
3 1 4 1 5
Output
4 2 4 2 5
思路:排序后二分查找即可,用upper_bound更快。upper_bound()返回的是被查序列中第一个大于查找值的指针,也就是返回指向被查值>查找值的最小指针
#include <iostream>#include <cstdio>#include <algorithm>using namespace std;const int maxn = 2e5 + 10;int main(){ int n, m; int a[maxn], b[maxn]; scanf("%d%d", &n, &m); for(int i = 0; i < n; i++) { scanf("%d", &a[i]); } sort(a, a+n); for(int j = 0; j < m; j++) { scanf("%d", &b[j]); } for(int j = 0; j < m; j++) { int pos = upper_bound(a, a+n, b[j]) - a; if(j==m-1) printf("%d\n", pos); else printf("%d ", pos); } return 0;}
- Codeforces 600B Queries about less or equal elements(二分、upper_bound()的应用)
- Codeforces-600B Queries about less or equal elements(二分)
- Codeforces 600B Queries about less or equal elements(二分查找)
- Codeforces 600B Queries about less or equal elements 【离散化去重二分查找 + 树状数组】
- 【CodeForces 600B 】Queries about less or equal elements(二分查找)
- codeforces Queries about less or equal elements 二分
- codeforces B.Queries about less or equal elements
- Codeforces 600.B Queries about less or equal elements
- Educational Codeforces Round 2B. Queries about less or equal elements(二分查找)
- Educational Codeforces Round 2 B. Queries about less or equal elements (二分)
- Educational Codeforces Round 2 B.Queries about less or equal elements(排序&&二分)
- cordforces 600B Queries about less or equal elements
- Codeforces Educational Codeforces Round 2 B. Queries about less or equal elements
- codeforces_600B. Queries about less or equal elements(排序二分)
- Educational Codeforces Round 2 B. Queries about less or equal elements
- 【Educational Codeforces Round 2B】【map or 二分查找】Queries about less or equal elements b[]中的每个数比a[]中多少数大
- Queries about less or equal elements
- Educational Codeforces Round 2_B. Queries about less or equal elements
- 自媒体淘客必备的基础知识你知道这些吗
- 达内云笔记(五) Mybatis复杂SQL问题
- 使用backup as copy 备份部分表空间并做不完全恢复
- 1007. 素数对猜想 (20)
- apache安装笔记
- Codeforces 600B Queries about less or equal elements(二分、upper_bound()的应用)
- AIDE使用
- java使用Jsoup解析html字符串
- PHP 回调函数
- javaScript 继承
- 深度学习_资料汇总链接(目标检测/可视化/目标识别/自然语言处理/OCR)
- 花旗前端面试
- 无人车技术基础——课程3:Particle Filters
- Spark集群搭建与并验证环境是否搭建成功(三台机器)