Cod sursa(job #2871695)
Utilizator | Data | 15 martie 2022 15:27:07 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,i,a[10005],m,x,st,dr,mij,poz,b[10005];
int main()
{
f>>n>>m;
for(i=1;i<=n;i++) {
f>>a[i];
}
sort(a+1,a+n+1);
for(i=1;i<=m;i++) {
f>>x;
st=1;
dr=n;
poz=0;
while(st<=dr) {
mij=(st+dr)/2;
if(a[mij]>=x) dr=mij-1;
if(a[mij]<=x) {
b[i]=mij;
st=mij+1;
}
}
}
for(i=1;i<=m;i++) g<<b[i]<<'\n';
}