제출 #1180322

#제출 시각아이디문제언어결과실행 시간메모리
1180322bbartekExhibition (JOI19_ho_t2)C++20
100 / 100
31 ms2044 KiB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define st first
#define nd second
#define pb push_back

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n,m;
    cin>>n>>m;

    vector<pair<int,int>> obrazy;
    vector<int> ramki;

    int a,b;
    for(int i=1;i<=n;i++){
        cin>>a>>b;
        obrazy.pb({b,a});
    }

    for(int i=1;i<=m;i++){
        cin>>a;
        ramki.pb(a);
    }

    sort(obrazy.begin(),obrazy.end(),greater<pair<int,int>>());
    sort(ramki.begin(),ramki.end(),greater<int>());

    int akt_ramka = 0;
    for(auto [val,roz] : obrazy){
        if(roz <= ramki[akt_ramka]){
            akt_ramka++;
            if(akt_ramka == m)
                break;
        }
    }

    cout<<akt_ramka<<"\n";

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...