View Code of Problem 4068

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main(void)
{
    vector<int> v1, v2;
    int n;
    while (cin >> n && n != 0)
    {
        v1.clear();
        v2.clear();
        for (int i = 0; i < n; i++)
        {
            int a;
            cin >> a;
            v1.push_back(a);
        }
        for (int i = 0; i < n; i++)
        {
            int a;
            cin >> a;
            v2.push_back(a);
        }
        sort(v1.rbegin(), v1.rend());
        sort(v2.rbegin(), v2.rend());
        auto tmp = v1[v1.size() - 1];
        v1.insert(v1.begin(),tmp);
        v1.pop_back();
        int a, b;
        a = b = 0;
        for (int i = 0; i < v2.size();i++){
            if(v1[i] < v2[i])
                b++;
            else if(v1[i] > v2[i])
                a++;
        }
        cout << a - b << endl;
    }
}