Submission #147142

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <cmath>

using namespace std;

using LL = long long;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VS = vector<string>;
using SS = stringstream;
using PII = pair<int,int>;
using VPII = vector< pair<int,int> >;
template < typename T = int > using VT = vector<T>;
template < typename T = int > using VVT = VT< VT<T> >;
template < typename T = int > using LIM = numeric_limits<T>;

template < typename T > inline T fromString( const string &s ){ T res; istringstream iss( s ); iss >> res; return res; };
template < typename T > inline string toString( const T &a ){ ostringstream oss; oss << a; return oss.str(); };

#define REP( i, m, n ) for ( int i = (int)( m ); i < (int)( n ); ++i )
#define FOR( e, c ) for ( auto &e : c )
#define ALL( c ) (c).begin(), (c).end()
#define AALL( a, t ) (t*)a, (t*)a + sizeof( a )
#define DRANGE( c, p ) (c).begin(), (c).begin() + p, (c).end()

#define PB( n ) push_back( n )
#define MP( a, b ) make_pair( ( a ), ( b ) )
#define EXIST( c, e ) ( (c).find( e ) != (c).end() )

#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );

	int t, n;
	cin >> t >> n;

	VI creates( 101 );
	REP( i, 0, n )
	{
		int a;
		cin >> a;
		creates[a]++;
	}

	int m;
	cin >> m;

	VI coming( 101 );
	REP( i, 0, m )
	{
		int b;
		cin >> b;
		coming[b]++;
	}

	priority_queue< int, VI, greater<int> > que;
	REP( i, 0, 101 )
	{
		while ( creates[i]-- ) que.push( i );
		while ( !que.empty() && t < i - que.top() ) que.pop();
		if ( (int)que.size() < coming[i] )
		{
			cout << "no" << endl;
			return 0;
		}
		while ( coming[i]-- ) que.pop();
	}

	cout << "yes" << endl;

	return 0;
}

Submission Info

Judge Result