Submission #654034

#TimeUsernameProblemLanguageResultExecution timeMemory
654034sofija6Exhibition (JOI19_ho_t2)C++14
100 / 100
58 ms5720 KiB
#include <bits/stdc++.h>
#define ll long long
#define MAXN 100010
using namespace std;
ll c[MAXN];
vector<pair<ll,ll> > p;
bool Cmp(pair<ll,ll> a,pair<ll,ll> b)
{
    if (a.first!=b.first)
        return a.first>b.first;
    return a.second>b.second;
}
int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n,m,s,v;
    cin >> n >> m;
    for (ll i=1;i<=n;i++)
    {
        cin >> s >> v;
        p.push_back({v,s});
    }
    sort(p.begin(),p.end());
    for (ll i=1;i<=m;i++)
        cin >> c[i];
    sort(c+1,c+1+m);
    ll pos=n-1,ans=0;
    for (ll i=m;i>=1;i--)
    {
        while (pos>=0 && p[pos].second>c[i])
            pos--;
        if (pos>=0)
        {
            ans++;
            pos--;
        }
    }
    cout << ans;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...