Submission #1255572

#TimeUsernameProblemLanguageResultExecution timeMemory
1255572Born_To_LaughExhibition (JOI19_ho_t2)C++17
100 / 100
37 ms2648 KiB
// 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 n, m; pair<int,int> item[maxn]; int frames[maxn]; /* first = value second = size */ bool check(int len){ int j = m - len + 1; for(int i=1; i<=n; ++i){ if(item[i].second > frames[j])continue; j++; } return j > m; } 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); int hi = m; int lo = 1; int res = 0; while(hi >= lo){ int mid = (hi + lo) >> 1; if(check(mid)){ lo = mid+1; res = mid; } else hi = mid - 1; } cout << res << '\n'; } signed main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...