40pts求助
查看原帖
40pts求助
1074084
asd890123楼主2024/4/7 20:45
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e5 + 5;

int cmp(const void* a,const void* b){return *((int*)a) - *((int*)b);}

int main(){
    
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    
    int n,m,a[MAXN],b[MAXN];
    
    cin >> n >> m;
    b[0] = 0;
    for (int i = 1;i <= n;i++) cin >> a[i];
    for (int i = 1;i <= m;i++) cin >> b[i];
    qsort(b,m + 1,sizeof(int),cmp);
    for (int i = 1;i <= n;i++)
        if ((upper_bound(b + 1,b + 1 + n,a[i]) - b) - (lower_bound(b + 1,b + 1 + n,a[i]) - b)) 
            cout << a[i] << ' ';
    cout << endl;
    
    return 0;
}
2024/4/7 20:45
加载中...