Educational Codeforces Round 76 (Rated for Div. 2) D. Yet Another Monster Killing Problem贪心+二分

D. Yet Another Monster Killing Problem

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You play a computer game. In this game, you lead a party of mm heroes, and you have to clear a dungeon with nn monsters. Each monster is characterized by its power aiai. Each hero is characterized by his power pipi and endurance sisi.

The heroes clear the dungeon day by day. In the beginning of each day, you choose a hero (exactly one) who is going to enter the dungeon this day.

When the hero enters the dungeon, he is challenged by the first monster which was not defeated during the previous days (so, if the heroes have already defeated kk monsters, the hero fights with the monster k+1k+1). When the hero fights the monster, there are two possible outcomes:

• if the monster's power is strictly greater than the hero's power, the hero retreats from the dungeon. The current day ends;
• otherwise, the monster is defeated.

After defeating a monster, the hero either continues fighting with the next monster or leaves the dungeon. He leaves the dungeon either if he has already defeated the number of monsters equal to his endurance during this day (so, the ii-th hero cannot defeat more than sisi monsters during each day), or if all monsters are defeated — otherwise, he fights with the next monster. When the hero leaves the dungeon, the current day ends.

Your goal is to defeat the last monster. What is the minimum number of days that you need to achieve your goal? Each day you have to use exactly one hero; it is possible that some heroes don't fight the monsters at all. Each hero can be used arbitrary number of times.

Input

The first line contains one integer tt (1≤t≤1051≤t≤105) — the number of test cases. Then the test cases follow.

The first line of each test case contains one integer nn (1≤n≤2⋅1051≤n≤2⋅105) — the number of monsters in the dungeon.

The second line contains nn integers a1a1, a2a2, ..., anan (1≤ai≤1091≤ai≤109), where aiai is the power of the ii-th monster.

The third line contains one integer mm (1≤m≤2⋅1051≤m≤2⋅105) — the number of heroes in your party.

Then mm lines follow, each describing a hero. Each line contains two integers pipi and sisi (1≤pi≤1091≤pi≤109, 1≤si≤n1≤si≤n) — the power and the endurance of the ii-th hero.

It is guaranteed that the sum of n+mn+m over all test cases does not exceed 2⋅1052⋅105.

Output

For each test case print one integer — the minimum number of days you have to spend to defeat all of the monsters (or −1−1 if it is impossible).

有一很多英雄很多怪兽，每个英雄每天最多杀si的战斗力比他低的怪兽，求最小天数

对于每一个起点我们可以直接进行贪心的选择当前能走到的最靠后的位置

所以我们考虑二分找到最优的位置

要进行二分首先我们的英雄优劣性一定是单调的 就是说去除掉那种战斗力和耐久力都比别的英雄小的英雄

然后在pair里二分出当前可选择的战斗力最低的英雄，这样耐久力一定最高

然后跑循环即可

#include<bits/stdc++.h>
using namespace std;
using PI=pair<int,int>;
int a[200005];
bool cmp(PI p,PI q)
{
    if(p.first==q.first)
    {
        return p.second>q.second;
    }
    return p.first>q.first;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        vector<PI>ve1;
        vector<PI>ve2;
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
        }
        int m;
        scanf("%d",&m);
        for(int i=1;i<=m;i++)
        {
            PI tmp;
            scanf("%d%d",&tmp.first,&tmp.second);
            ve1.push_back(tmp);
        }
        sort(ve1.begin(),ve1.end(),cmp);
        int MAX=0;
        for(int i=0;i<m;i++)
        {
            if(ve1[i].second>MAX)
            {
                ve2.push_back(ve1[i]);
                MAX=ve1[i].second;
            }
        }
        sort(ve2.begin(),ve2.end());
        int ans=1;
        int num=0;
        int cur=0;
        //cout<<":"<<ve2.size()<<endl;
        for(int i=1;i<=n;i++)
        {
            num++;
            int pos=lower_bound(ve2.begin(),ve2.end(),make_pair(a[i],0))-ve2.begin();
            cur=max(pos,cur);
            if(pos==ve2.size()) {ans=-1;break;}
            else
            {
                if(ve2[cur].second<num) ans++,num=1,cur=lower_bound(ve2.begin(),ve2.end(),make_pair(a[i],0))-ve2.begin();
            }
            //cout<<pos<<" "<<i<<":"<<ans<<endl;
        }
        printf("%d\n",ans);
    }
}