codeforces 1270A. Card Game

math Zinnatul Islam Morol Thursday, January 02, 2020

Problem link

A solution in c++

	#include<bits/stdc++.h>

	using namespace std;

	#pragma GCC optimize("Ofast,no-stack-protector")
	#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
	#pragma GCC optimize("unroll-loops")

	/// Typedef
	typedef long long ll;

	#define sc1(a) scanf("%lld",&a)
	#define sc2(a,b) scanf("%lld %lld",&a,&b)

	#define pf1(a) printf("%lld\n",a)
	#define pf2(a,b) printf("%lld %lld\n",a,b)

	#define vpnt(ans) for(ll i = 0; i < ans.size(); i++) cout << ans[i] << (i + 1 < ans.size() ? ' ' : '\n');
	#define apnt(arr, num) for(ll i = 0; i < num; i++) cout << arr[i] << (i + 1 < num ? ' ' : '\n');

	#define mx 200005
	#define mod 1000000007
	#define PI acos(-1.0)
	#define eps 1e-7

	#define size1 200005

	#define no cout << "NO" << endl
	#define yes cout << "YES" << endl
	#define mem(name, value) memset(name, value, sizeof(name))

	#define pb push_back
	#define ff first
	#define ss second
	#define mp make_pair
	#define case cout << "Case " << t++ << ": ";

	typedef vector <ll> vll;
	typedef set <ll> sll;
	typedef queue <ll> qll;
	typedef map <ll, ll> mll;
	typedef pair <ll, ll> pll;
	typedef vector <pair <ll , ll> > vpll;

	int main() {

	//freopen("/opt/Coding/clion code/input.txt", "r", stdin);

	ll n, m, num, tc, t = 1;

	sc1(tc);

	while (tc--){
	ll a, b;
	sc1(num);
	sc2(a, b);
	ll sum1 = 0, sum2 = 0;
	for (ll i = 0; i < a; ++i) {
	sc1(m);
	sum1 = max(sum1, m);
	}

	for (ll i = 0; i < b; ++i) {
	sc1(m);
	sum2 = max(sum2, m);
	}

	if(sum1 > sum2) yes;
	else no;
	}
	}