1 solutions

  • 0
  • 0
    @ 2026-4-7 18:20:34

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    #include <bits/stdc++.h> using namespace std;

    const int N = 1e5+10;

    int n,m; int a[N];

    int main(){ cin >> n >> m; for(int i = 0;i < n;i++){ cin >> a[i]; } sort(a,a+n); while(m--){ int w; cin >> w; int l = 0,r = n; while(l < r){ int mid = (l+r)/2; if(a[mid]<=w){ l = mid+1; }else{ r = mid; } } cout << l << endl; } return 0; }

    • 1

    蜂窝探险

    Information

    ID
    96
    Time
    1000ms
    Memory
    512MiB
    Difficulty
    9
    Tags
    (None)
    # Submissions
    32
    Accepted
    2
    Uploaded By
    1. About
    2. Contact Us
    3. Privacy
    4. Terms of Service
    5. Copyright Complaint
    6. Language
    7. Legacy mode
    8. Theme
    3. Worker 0, 312ms
    4. Powered by Hydro v4.19.1 Community