Codeforces 600B Queries about less or equal elements(二分查找)
来源:互联网 发布:淘宝csv数据怎么制作 编辑:程序博客网 时间:2024/06/11 12:13
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 athat are less than or equal to the value bj.
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).
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.
5 41 3 5 7 96 4 2 8
3 2 1 4
5 51 2 1 2 53 1 4 1 5
4 2 4 2 5
题意:求b数组中每个元素在a数组中比其小或者等于的数的个数。
sort排序之后,暴力一发超时,我真是菜啊,居然第一反应是暴力。
很简单的二分查找,C++STL里面的upper_bound(a,a+n,k)函数求出的值就表示的是指向满足ai>k的ai的最小指针。
所以用STL求解很简单,代码如下:
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int a[200010],b[200010];int main(){int n,m,i,j;while(scanf("%d%d",&n,&m)!=EOF){for(i=0;i<n;++i)scanf("%d",&a[i]);sort(a,a+n);for(j=0;j<m;++j)scanf("%d",&b[j]);for(i=0;i<m;++i){if(i==m-1)printf("%d\n",upper_bound(a,a+n,b[i])-a);else printf("%d ",upper_bound(a,a+n,b[i])-a);} }return 0;}
- 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(二分查找)
- Educational Codeforces Round 2B. Queries about less or equal elements(二分查找)
- Codeforces 600B Queries about less or equal elements(二分、upper_bound()的应用)
- 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 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
- 【Educational Codeforces Round 2B】【map or 二分查找】Queries about less or equal elements b[]中的每个数比a[]中多少数大
- 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
- Queries about less or equal elements
- Educational Codeforces Round 2_B. Queries about less or equal elements
- 10007---注入属性值细节
- vim的跳转
- 再次唠叨linux中的strings命令
- UESTC 1012 Ladygod 任意进制的转化
- [Swoole入门]-异步毫秒定时器
- Codeforces 600B Queries about less or equal elements(二分查找)
- 排序算法之插入排序
- 杭电ACM 1012 1013 1014
- hiho刷题日记——第二十三天最短路径·一
- java佩恩沃星球改进版1.0
- 今天第一次系统返回的数据里面有笑脸,探测笑脸ASCII 01
- hdu1172 猜数字(枚举)
- 关于以后计算机形态的一个畅想
- CSDN《老友记》简记