Submission #1255560

#	Time	Username	Problem	Language	Result	Execution time	Memory
1255560		Born_To_Laugh	Exhibition (JOI19_ho_t2)	C++17	10 / 100	1093 ms	328 KiB

joi2019_ho_t2

// Born_To_Laugh - Hughie Do
#include <bits/stdc++.h>
#define alle(AC) AC.begin(), AC.end()
using namespace std;
typedef long long ll;
[[maybe_unused]] const ll MOD = 998244353, INF = 1e9 + 7;
const int maxn = 1e5 + 10;
int ans = 0;
int n, m;
pair<int,int> item[maxn];
int frames[maxn];
/*
first = value
second = size
*/
void recur(int j, int i, int num){
    if(j > m || i > n)return;
    recur(j + 1, i, num);
    while(i <= n && item[i].second > frames[j])i++;
    if(i <= n && item[i].second <= frames[j]){
        ans = max(ans, num + 1);
        recur(j + 1, i + 1, num + 1);
    }
}
void solve(){
    cin >> n >> m;
    for(int i=1; i<=n; ++i){
        cin >> item[i].second >> item[i].first;
    }
    for(int i=1; i<=m; ++i)cin >> frames[i];
    sort(frames + 1, frames + m + 1);
    sort(item + 1, item + n + 1);
    recur(1, 1, 0);
    cout << ans << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
}

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