Submission #1293552

#	Time	Username	Problem	Language	Result	Execution time	Memory
1293552		harryleee	Exhibition (JOI19_ho_t2)	C++20	100 / 100	82 ms	6296 KiB

joi2019_ho_t2

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

#define NAME "A"
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define MASK(x) (1ll << (x))
#define BIT(x, i) (((x) >> (i)) & 1)

const int N = 1e5 + 5;

int n, m;
int c[N];
pair<int, int> a[N];

void input() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> a[i].fi >> a[i].se;
    }
    for (int i = 1; i <= m; i++) {
        cin >> c[i];
    }
}

void solve() {
    sort(a + 1, a + 1 + n);
    sort(c + 1, c + 1 + m, greater<>());
    set<pair<int, int>> s;
    for (int i = 1; i <= n; i++) {
        s.insert({a[i].se, i});
    }
    int j = n;
    int ans = 0;
    for (int i = 1; i <= m; i++) {
        while (j >= 1 && a[j].fi > c[i]) {
            if (s.find({a[j].se, j}) != s.end()) {
                s.erase({a[j].se, j});
            }
            j--;
        }
        if (s.empty()) break;
        ans = i;
        auto it = *s.rbegin();
        s.erase(it);
    }
    cout << ans;
}

signed main() {
    if (fopen(NAME".INP", "r")) {
        freopen(NAME".INP", "r", stdin);
        freopen(NAME".OUT", "w", stdout);
    }
    cin.tie(0)->sync_with_stdio(0);

    int t = 1;
    //cin >> t;
    while (t--) {
        input();
        solve();
    }

    return 0;
}

Compilation message (stderr)

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:55:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |         freopen(NAME".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:56:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |         freopen(NAME".OUT", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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