1013A - Piles With Stones - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
typedef vector<int> v;
typedef unordered_map<int, int> mp;
typedef vector<ll> vll;
#define nl cout << endl;
#define F first
#define S second
#define pf pop_back
#define pb push_back
#define no cout << "NO\n"
#define yes cout << "YES\n"
#define all(v) v.begin(), v.end()
#define dec(v) v.rbegin(), v.rend()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define decimal(n) fixed << setprecision(n)
#define fast                    \
	ios_base::sync_with_stdio(0); \
	cin.tie(0);                   \
	cin.tie(nullptr);             \
	cout.tie(nullptr);
// #define d 1000000007
#define lu unsigned long long int

void solve()
{
	int n;
	cin >> n;
	int a[n], b[n], s1 = 0, s2 = 0;
	rep(i, n)
	{
		cin >> a[i];
		s1 += a[i];
	}
	rep(i, n)
	{
		cin >> b[i];
		s2 += b[i];
	}
	if (s1 >= s2)
		yes;
	else
		no;
}
int main()
{
	// freopen("input.txt","r",stdin);
	// freopen("output.txt","w",stdout);
	fast;
	ll t = 1;
	// cin >> t;
	while (t--)
	{
		solve();
	}
}