oj.uz

Submission #838853

# Submission time Handle Problem Language Result Execution time Memory
838853 2023-08-27T23:24:00 Z DeathIsAwe Exhibition (JOI19_ho_t2) C++17
0 / 100
 0 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;
int bruh[100000];

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;
    for (int i=0;i<n;i++) {
        sus=lower_bound(frames.begin(),frames.end(),paintings[i].first)-frames.begin();
        bruh[i]=sus;
    }
    
    int ans=0,counter=0;
    for (int i=n-1;i>-1;i--) {
        if (bruh[i]<m-counter) {
            ans++; counter++;
        }
    }
    cout << ans;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -