This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define F first
#define S second
#define ti(a) ((int)a-'a')
#define all(a) a.begin(),a.end()
#define sz(a) ((int)a.size())
#define mp make_pair
#define endl '\n'
using namespace std;
signed main(){
int n;
cin>>n;
vector<int> a(n),b(n);
int s,p;
s=p=0;
for(int i=0;i<n;i++){
cin>>a[i]>>b[i];
s+=a[i];
p+=b[i];
}
if(s==p) cout<<"Yes";
else cout<<"No";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |