Submission #669243

#	Time	Username	Problem	Language	Result	Execution time	Memory
669243		pavement	Exhibition (JOI19_ho_t2)	C++17	100 / 100	51 ms	7200 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
#define g4(a) get<4>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using db = double;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using iii = tuple<int, int, int>;
using iiii = tuple<int, int, int, int>;
template<class key, class value = null_type, class cmp = less<key> >
using ordered_set = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;

int N, M, S[100005], V[100005], C[100005];
ii T[100005];

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> M;
	for (int i = 1; i <= N; i++) {
		cin >> S[i] >> V[i];
		T[i] = mp(V[i], S[i]);
	}
	sort(T + 1, T + 1 + N);
	for (int i = 1; i <= M; i++) {
		cin >> C[i];
	}
	sort(C + 1, C + 1 + M);
	int lo = 0, hi = M, ans = -1;
	while (lo <= hi) {
		int mid = (lo + hi) / 2, ptr = 1;
		bool bad = 0;
		for (int i = M - mid + 1; i <= M; i++) {
			while (ptr <= N && T[ptr].second > C[i]) ptr++;
			if (ptr > N) {
				bad = 1;
				break;
			} else ptr++;
		}
		if (bad) hi = mid - 1;
		else ans = mid, lo = mid + 1;
	}
	cout << ans << '\n';
}

Compilation message (stderr)

joi2019_ho_t2.cpp:30:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   30 | main() {
      | ^~~~

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