算法（二分）

1850: 【基础】最满意的方案

#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int a[100100],b[100100];
int main()
{
	int n,m;
	cin>>n>>m;
	for(int i=1; i<=n; i++)
	{
		cin>>a[i];
	}
	for(int i=1; i<=m; i++)
	{
		cin>>b[i];
	}
	sort(a+1,a+n+1);
	int ans=0;
	for(int i=1; i<=m; i++)
	{
		int l=0,r=n+1;
		while(l<r)
		{
			int mid=(l+r)/2;
			if(a[mid]<=b[i])
			{
				l=mid+1;
			}
			else
			{
				r=mid;
			}
		}
		if(b[i]<=a[1])
		{
			ans+=a[1]-b[i];
		}
		else
		{
			ans+=min(abs(a[l-1]-b[i]),abs(a[l]-b[i]));//加上两个绝对值中最小
		}
	}
	cout<<ans;
	return 0;
}

1849: 【基础】同时出现的数

#include <iostream>
#include <cstdio> 
#include <algorithm> 
using namespace std;
int n, m, k;
int a[100005], b[100005], c[100005];
int main () {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
	}
	sort(a+1, a+n+1);
	for (int i = 1; i <= m; i++) {
		scanf("%d", &b[i]);
		int l = 1, r = n;
		while (l <= r) {
			int mid = l + (r - l) / 2;
			if (b[i] > a[mid]) {
				l = mid + 1;
			} else if (b[i] < a[mid]) {
				r = mid - 1;
			} else {
				c[k++] = b[i];
				break;
			}
		}
	}
	sort(c, c+k);
	for (int i = 0; i < k - 1; i++) {
		printf("%d ", c[i]);
	}
	printf("%d", c[k-1]);
}

1846: 【入门】二分查找右侧边界

#include <bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int a[N],n,x;
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
    }
    cin>>x;
    int b=upper_bound(a+1,a+n+1,x)-a;
    if(a[b-1]==x)cout<<b-1;
    else cout<<-1;
}

1845: 【入门】二分查找左侧边界

#include <bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int a[N],n,x;
int main(){
    cin>>n;
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    cin>>x;
    int b=lower_bound(a+1,a+n+1,x)-a;
    if(a[b]==x)cout<<b;
    else cout<<-1;
}

1387: 【入门】二分查找

#include <bits/stdc++.h>
using namespace std;
int main() {
    int n,a[1000001],x;
    cin>>n;
    for (int i=1;i<=n;i++){
        scanf("%d",&a[i]);
    }
    cin>>x;
    int l=1,r=n;
    while(l<=r){
         int m=(l+r)/2;
         if(x<a[m]){
             r=m-1;
         }
         if(x>a[m]){
             l=m+1;
         }
         if(x==a[m]){
            cout<<m;
            return 0;
         }
    }
    cout<<-1;
}