Submission #838894

#	Time	Username	Problem	Language	Result	Execution time	Memory
838894		DeathIsAwe	Exhibition (JOI19_ho_t2)	C++17	100 / 100	147 ms	5044 KiB

joi2019_ho_t2

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

bool comp(pair<int,int>&a, pair<int,int>&b) {
    if (a.second==b.second) {
        return a.first<b.first;
    }
    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;    
}

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