Pagini recente » Cod sursa (job #611876) | Cod sursa (job #501978) | Cod sursa (job #1578939) | Cod sursa (job #3121058) | Cod sursa (job #1981229)
#include <bits/stdc++.h>
using namespace std;
ifstream in ( "hvrays.in" );
ofstream out( "hvrays.out" );
const int DIM = 1e5 + 5;
pair<int, int> hray[DIM], vray[DIM];
int main( void ) {
int t;
in >> t;
while( t -- ) {
int n, m;
in >> n >> m;
for( int i = 1; i <= n; i ++ )
in >> hray[i].first >> hray[i].second;
for( int i = 1; i <= m; i ++ )
in >> vray[i].first >> vray[i].second;
sort( hray + 1, hray + n + 1, greater<pair<int, int> >() );
sort( vray + 1, vray + m + 1, greater<pair<int, int> >() );
int mxm = -1, ans = 0;
for( int i = 1, j = 1; i <= n; i ++ ) {
if( mxm >= hray[i].second )
continue;
ans ++;
while( j <= m && vray[j].first >= hray[i].first )
mxm = max( mxm, vray[j ++].second );
}
out << ans << endl;
}
return 0;
}