oj.uz

답안 #330362

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
330362 2020-11-25T00:00:48 Z fishy15 Exhibition (JOI19_ho_t2) C++14
0 / 100
 1 ms 364 KB 
#include <iostream>
#include <iomanip>
#include <fstream>
#include <vector>
#include <array>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <set>
#include <cmath>
#include <cstdio>
#include <cstring>

#define ll long long
#define ld long double
#define eps 1e-8
#define MOD 1000000007

#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3f

// change if necessary
#define MAXN 100010

using namespace std;

int n, m;
pair<int, int> paint[MAXN];
int frame[MAXN];

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> m;

    for (int i = 0; i < n; i++) {
        cin >> paint[i].first >> paint[i].second;
    }

    for (int i = 0; i < m; i++) {
        cin >> frame[i];
    }

    sort(paint, paint + n, [](const pair<int, int> &p1, const pair<int, int> &p2) {
        return p1.second < p2.second;
    });

    sort(frame, frame + m);

    int cur_p = n - 1;
    int ans = 0;
    for (int i = m - 1; i >= 0; i--) {
        while (cur_p >= 0 && paint[cur_p].first > frame[i]) cur_p--;
        if (cur_p >= 0) {
            ans++;
            cur_p -= 1;
        }
    }

    cout << ans << '\n';

    return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 356 KB Output is correct
3 Incorrect 0 ms 364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 356 KB Output is correct
3 Incorrect 0 ms 364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 356 KB Output is correct
3 Incorrect 0 ms 364 KB Output isn't correct
4 Halted 0 ms 0 KB -