1257D - Yet Another Monster Killing Problem - CodeForces Solution

import sys
input = sys.stdin.readline

def readList():
    return list(map(int, input().split()))
def readInt():
    return int(input())
def readInts():
    return map(int, input().split())
def readStr():
    return input().strip()

def solve():
    n, arr, m = readInt(), readList(), readInt()
    power = [0] * (n+1)
    for _ in range(m):
        p, s = readInts()
        power[s] = max(power[s], p)
    for i in range(n-1, 0, -1):
        power[i] = max(power[i], power[i+1])

    if max(arr) > power[1]:
        return -1

    cnt, cp, ans = 0, 0, 1
    for i in range(n):
        cp = max(cp, arr[i])
        if cp <= power[cnt+1]:
            cnt += 1
        else:
            ans += 1
            cnt, cp = 1, arr[i]
    return ans


for _ in range(int(input())):
    print(solve())