제출 #371035

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
371035		peijar	Exhibition (JOI19_ho_t2)	C++17	0 / 100	1 ms	492 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
#define SZ(v) ((int)(v).size())
using namespace std;

using ll = long long;

template<typename... Args>
void read(Args&... args)
{
	((cin >> args), ...);
}
template<typename T>
void read(vector<T> &vec)
{
	for (auto &v : vec) read(v);
}

void write() {}
template<typename H, typename... T>
void write(const H &h, const T&... t)
{
	cout << h;
	if (sizeof...(t)) {cout << ' '; write(t...);}
}

template<typename T>
void write(const vector<T> &vec)
{
	if (SZ(vec) == 0) return;
	write(vec[0]);
	for (int i(1); i < SZ(vec); ++i)
	{cout << ' '; write(vec[i]);}
}

template<typename... Args>
void writeln(Args... args)
{
	write(args...); cout << '\n';
}

int main(void)
{
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	int nbPhotos, nbCadres;
	read(nbPhotos, nbCadres);
	vector<pair<int, int>> photos(nbPhotos);
	for (auto &[taille, valeur] : photos)
		read(taille, valeur);
	sort(photos.begin(), photos.end(),
			[](pair<int, int> a, pair<int, int> b)
			{
				if (a.second == b.second)
					return a.first == b.first;
				return a.second > b.second;
			});
	vector<int> cadres(nbCadres);
	read(cadres);
	sort(cadres.rbegin(), cadres.rend());
	int sol(0);
	int deb(0);
	for (int i(0); i < nbCadres; ++i)
	{
		while (deb < nbPhotos and photos[deb].first > cadres[i])
			++deb;
		if (deb == nbPhotos)
			break;
		sol++;
		++deb;
	}
	writeln(sol);
}

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