Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int main(){
- ios::sync_with_stdio(0);
- cin.tie(0);
- int n1;
- cin >> n1;
- int* nums1 = new int[n1];
- for(int i=0; i<n1; i++){
- cin>>nums1[i];
- }
- int n2;
- cin >> n2;
- set<int> nums2;
- int t;
- for(int i=0; i<n2; i++){
- cin >> t;
- nums2.insert(t);
- }
- for(int i=0; i<n1; i++){
- if(nums2.find(10000-nums1[i]) != nums2.end()){
- cout << "YES";
- return 0;
- }
- }
- cout << "NO";
- return 0;
- }
- #include <bits/stdc++.h>
- using namespace std;
- int main(){
- ios::sync_with_stdio(0);
- cin.tie(0);
- unsigned int n1;
- cin >> n1;
- set<int> nums1;
- int t;
- for(int i=0; i<n1; i++){
- cin >> t;
- nums1.insert(t);
- }
- unsigned int n2;
- cin >> n2;
- bool res = false;
- for(int i=0; i<n2; i++){
- cin >> t;
- if(nums1.find(10000 - t) != nums1.end())
- res = true;
- }
- cout << ((res)?"YES":"NO");
- return 0;
- }
Add Comment
Please, Sign In to add comment