oj.uz

답안 #838884

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
838884 2023-08-28T05:12:38 Z DeathIsAwe Exhibition (JOI19_ho_t2) C++17
0 / 100
 0 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long int

bool comp(pair<int,int>&a, pair<int,int>&b) {
    return a.second<b.second;
}

int32_t 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
0 / 10.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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 -