Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <algorithm>
- using namespace std;
- int main() {
- int n;
- cin >> n;
- int podaroci[n];
- for(int i = 0; i < n; i++) {
- cin >> podaroci[i];
- }
- int m;
- cin >> m;
- int kutii[m];
- for(int i = 0; i < m; i++) {
- cin >> kutii[i];
- }
- sort(kutii, kutii + m);
- int najmala_razlika = 2e9;
- int podarok = -1;
- for(int i = 0; i < n; i++) {
- int idx = lower_bound(kutii, kutii + m, podaroci[i]) - kutii;
- if(idx >= 0 and idx < m) {
- if(najmala_razlika > kutii[idx] - podaroci[i]) {
- najmala_razlika = kutii[idx] - podaroci[i];
- podarok = podaroci[i];
- }
- else if(najmala_razlika == kutii[idx] - podaroci[i]) {
- if(podarok < podaroci[i]) {
- podarok = podaroci[i];
- }
- }
- }
- }
- cout << podarok << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement