Submission #838859

#TimeUsernameProblemLanguageResultExecution timeMemory
838859DeathIsAweExhibition (JOI19_ho_t2)C++17
0 / 100
0 ms212 KiB
#include <bits/stdc++.h> using namespace std; bool comp(pair<int,int>&a, pair<int,int>&b) { return a.second<b.second; } int main() { int n,m; cin >> n >> m; vector<pair<int,int>> paintings(n); vector<int> frames(m); for (int i=0;i<n;i++) { cin >> paintings[i].first >> paintings[i].second; } for (int i=0;i<m;i++) { cin >> frames[i]; } sort(frames.begin(),frames.end()); sort(paintings.begin(),paintings.end(),comp); int sus; vector<int> bruh; for (int i=0;i<n;i++) { sus=lower_bound(frames.begin(),frames.end(),paintings[i].first)-frames.begin(); bruh.push_back(sus); } int ans=0; for (int i=n-1;i>-1;i--) { if (bruh[i]<m) { ans++; m--; } } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...