Submission #1237202

#	Time	Username	Problem	Language	Result	Execution time	Memory
1237202		Geforgs	Exhibition (JOI19_ho_t2)	C++20	100 / 100	31 ms	2632 KiB

joi2019_ho_t2

#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <unordered_map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
#define ll long long
#define ld long double
#define inf (ll)(2*1e18)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define pb push_back
#define endl "\n"
using namespace std;

void solve(){
    ll n, m, i, j, res=0;
    cin>>n>>m;
    vector<pair<ll, ll>> a(n);
    vector<ll> b(m);
    vector<ll> c;
    vector<ll> d;
    for(i=0;i<n;++i){
        cin>>a[i].second>>a[i].first;
    }
    for(i=0;i<m;++i){
        cin>>b[i];
    }
    sort(a);
    sort(b);
    reverse(a);
    reverse(b);
    j = 0;
    for(i=0;i<m;++i){
        for(;j<n;++j){
            if(a[j].second <= b[i]){
                ++j;
                ++res;
                break;
            }
        }
    }
    cout<<res<<endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    srand(time(nullptr));
    ll t=1;
//    cin>>t;
    for(;t>0;--t){
        solve();
    }
    return 0;
}

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