Submission #433476

#	Time	Username	Problem	Language	Result	Execution time	Memory
433476		MilosMilutinovic	Exhibition (JOI19_ho_t2)	C++14	100 / 100	180 ms	4496 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
#define MAXN 100007
using namespace std;
pair<int,int> a[MAXN];
int b[MAXN];
int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=0;i<n;i++) cin>>a[i].second>>a[i].first;
    for(int i=0;i<m;i++) cin>>b[i];
    sort(a,a+n);
    sort(b,b+m);
    int x=n-1,y=m-1,ans=0;
    while(x>=0 && y>=0)
    {
        if(b[y]>=a[x].second)
        {
            y--;
            ans++;
        }
        x--;
    }
    cout<<ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 40 / 40
• Subtask 3: 50 / 50