10
    vector <int> a(n), b(m);
    int i = 0, j = 0;
    while (i < a.size() || j < b.size())
        if (j == b.size() || i < a.size() && a[i] < b[])
            ++i;
        else
            if (a[i] == b[j++]) {
                cout « "YES";
                break;
            }
    cout << "no";





11
    vector <int> a(n), b(m);
    int i = 0, j = 0;
    while (i < a.size()|| j < b.size())
        if (j == b.size() || i < a.size() && a[i] < b[])
            ans = min(ans, a[i++] - b[j]);
        else
            ans = min(ans, b[j++] - a[i]);
    cout « ans;

12
    vector <int> a(n), b(n), ans(2*n);
    int i = n - 1, j = 0;
    while ((i || j < b.size()) && a[i] + b[j] != S) {
        if (a[i] + b[j] > S)
            ++i;
        else
            ++j;
    }
    cout << i << ' ' << j;





13
    vector <int> a(n), b(m);
    int i = 0, j = 0, cnt = 0, sum = 0;
    while (i < a.size() || j < b.size())
        if (j == b.size() || i < a.size() && a[i] < b[j]) {
            sum += cnt;
            if (i + 1 >= a.size() || a[i] != a[i + 1])
                cnt = 0;
        }
        else
            if (i < a.size() && a[i] == b[j])
                ++cnt;
    cout « sum;





14
    vector <int> a(n), b(m);
    int i = 0, j = 0, cnt = 0, sum = 0;
    while (i < a.size() || j < b.size())
        if (j == b.size() || i < a.size() && a[i] <= b[j]) {
            ++i;
        else
            ++j,
            sum += j*(n - i);
    cout << sum;