Pagini recente » Cod sursa (job #1899043) | Cod sursa (job #831529) | Cod sursa (job #334362) | Cod sursa (job #2406560) | Cod sursa (job #1492672)
#include<fstream>
#include<algorithm>
#define x first
#define y second
using namespace std;
ifstream f("hvrays.in"); ofstream g("hvrays.out");
const int Nmax=100005;
pair <int,int> o[Nmax],v[Nmax];
int main()
{ int n,m,i,cover,rez,t;
f>>t;
while(t--)
{ f>>n>>m;
for(i=1;i<=n;++i) f>>o[i].y>>o[i].x;
for(i=1;i<=m;++i) f>>v[i].y>>v[i].x;
sort(o+1,o+n+1);
sort(v+1,v+m+1);
cover=-1; rez=0;
while(n)
{ if(o[n].y>cover)
{ ++rez;
while(m&&v[m].x>=o[n].x)
{ if(v[m].y>cover) cover=v[m].y;
--m;
}
}
n--;
}
g<<rez<<"\n";
}
g.close(); return 0;
}