제출 #537379

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
537379		kawaii	Exhibition (JOI19_ho_t2)	C++14	100 / 100	72 ms	5684 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;
#define int long long

int t, n, m, mod = 1e9 + 7; 
mt19937_64 rng;

struct point{
    int s, h;
};

bool operator < (point a, point b){
    if(a.h == b.h) return a.s < b.s;
    return a.h < b.h;
}

point a[1000005];
int b[1000005];  

void solve(){  
    int crr = 1; 
    for(int i = n; i >= 1; i--){
        if(crr <= m && a[i].s <= b[m - crr + 1]){
            crr++;
            if(crr == m + 1) break; 
        }
    }
    cout << crr - 1 <<" ";
}

signed main(){
    ios_base::sync_with_stdio(NULL); cin.tie(nullptr); cout.tie(nullptr);
    rng.seed((int)main ^ time(0));
    #ifdef Kawaii
        auto starttime = chrono::high_resolution_clock::now();
    #endif

    cin >> n >> m;
    for(int i = 1; i <= n; i++) cin >> a[i].s >> a[i].h; 
    for(int i = 1; i <= m; i++) cin >> b[i]; 
    sort(b + 1, b + m + 1);
    sort(a + 1, a + n + 1); 
    solve();

    #ifdef Kawaii
        auto endtime = chrono::high_resolution_clock::now();
        auto duration = chrono::duration_cast<chrono::milliseconds>(endtime - starttime).count(); 
        cout << "\n=====" << "\nUsed: " << duration << " ms\n";
    #endif
}

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