USACO 2021 January Contest Bronze Division - Just Stalling

Problem link: here

Solution Author: Stefan Dascalescu

Problem Solution

Sort the arrays and then check each values one by one.

Source codes

The source codes in C++ and Python can be seen below.

#include <iostream>
#include <algorithm>

using namespace std;

int n, v[21], v2[21];
int main()
{

    cin >> n;
    for(int i = 1; i <= n; i++)
        cin >> v[i];
    sort(v + 1, v + n + 1);
    for(int i = 1; i <= n; i++)
        cin >> v2[i];
    sort(v2 + 1, v2 + n + 1);

    long long ans = 1;
    int poz2 = n;
    for(int i = n; i >= 1; i--)
    {
        while(poz2 > 0 && v2[poz2] >= v[i])
            poz2--;
        ans = ans * (i - poz2);
    }

    cout << ans;
    return 0;
}

n = int(input())
v = list(map(int, input().split()))
v.sort()
v2 = list(map(int, input().split()))
v2.sort()

ans = 1
poz2 = n
for i in range(n, 0, -1):
    while poz2 > 0 and v2[poz2 - 1] >= v[i - 1]:
        poz2 -= 1
    ans *= (i - poz2)
print(ans)