Submission #1294871

#	Time	Username	Problem	Language	Result	Execution time	Memory
1294871		ghammazhassan	Exhibition (JOI19_ho_t2)	C++20	100 / 100	35 ms	2788 KiB

joi2019_ho_t2

// #include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
#include <deque>
using namespace std;
#define int long long
#define endl "\n"
#define fi first
#define se second
const int M=1e9+7;
const int inf = 1e14;
const int LOG=18;
const int N=5e1+5;
int n , m , c , w , k , t=1 , q=1 , x , y , z , l , r;

void solve(){   
    cin >> n >> m;
    vector<pair<int,int>>a(n);
    vector<int>b(m);
    for (int i=0;i<n;i++){
        cin >> a[i].se >> a[i].fi;
    }
    for (int i=0;i<m;i++){
        cin >> b[i];
    }
    sort(a.rbegin(),a.rend());
    sort(b.rbegin(),b.rend());
    int j=0;
    c=0;
    for (int i=0;i<m;i++){
        while (j<n){
            if (b[i]<a[j].se){
                j++;
            }
            else{
                break;
            }
        }
        if (j!=n){
            j++;
            c++;
            // cout << j << " ";
        }
    }
    cout << c << endl;

    
}
signed main()    
{   

    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);//DO NOT USE IN INTERACTIVE
    cout << fixed << setprecision(9);
    srand(time(0));
    // int t=1;
    // cin >> t;
    for (int _=1;_<=t;_++){
        solve();
        q++;
    }
} 

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