Submission #1180542

#TimeUsernameProblemLanguageResultExecution timeMemory
1180542Szymon_PilipczukExhibition (JOI19_ho_t2)C++20
100 / 100
82 ms1452 KiB
#include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(),a.end()
#define rep(a,b) for(int a = 0;a<b;a++)
#define st first
#define nd second
int main()
{
    int n,m;
    cin>>n>>m;
    vector<pair<int,int>> p(n);
    for(int i = 0;i<n;i++)
    {
        int s,v;
        cin>>s>>v;
        p[i] = {v,s};
    }
    sort(p.begin(),p.end());
    reverse(all(p));
    vector<int> f(m);
    rep(i,m)
    {
        int k;
        cin>>k;
        f[i] = k;
    }
    sort(f.begin(),f.end());
    reverse(all(f));
    int j = 0;
    rep(i,n)
    {
        if(p[i].nd <= f[j])
        {
            j++;
        }
    }
    cout<<j<<"\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...