Submission #788524

#	Time	Username	Problem	Language	Result	Execution time	Memory
788524		mpawicka_77	Exhibition (JOI19_ho_t2)	C++14	100 / 100	134 ms	2408 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;
const int N=1e5+3;
int M[N];
pair<int,int>T[N];
int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)cin>>T[i].second>>T[i].first;
    sort(T+1,T+n+1);
    for(int i=1;i<=m;i++)cin>>M[i];
    sort(M+1,M+m+1);
    int ind=n,wyn=0;
    for(int i=m;i>=1;i--)
    {
        while(ind>0&&T[ind].second>M[i])
        {
            ind--;
        }
        if(ind==0)break;
        if(T[ind].second<=M[i])
        {
            ind--;
            wyn++;
        }
    }
    cout<<wyn;
    return 0;
}

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