Submission #349774

#	Time	Username	Problem	Language	Result	Execution time	Memory
349774		pavement	Exhibition (JOI19_ho_t2)	C++17	100 / 100	57 ms	7296 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;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#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)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef double db;
typedef long long ll;
typedef long double ld;
typedef long double ld;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int N, M, idx, 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 >> T[i].second >> T[i].first;
	sort(T + 1, T + 1 + N);
	for (int i = 1; i <= N; i++) tie(V[i], S[i]) = T[i];
	for (int i = 1; i <= M; i++) cin >> C[i];
	sort(C + 1, C + 1 + M);
	idx = M;
	for (int i = N; i >= 1; i--)
		if (idx && C[idx] >= S[i]) idx--;
	cout << M - idx << '\n';
}

Compilation message (stderr)

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

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