Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"strings"
	"sort"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	for scanner.Scan() {
		n, _ := strconv.Atoi(scanner.Text())
		if n == 0 {
			break
		}
		hr := make([]entry, 0)
		for i := 0; i < n; i++ {
			scanner.Scan()
			buf := strings.Split(scanner.Text(), " ")
			first, _ := strconv.Atoi(buf[0])
			second, _ := strconv.Atoi(buf[1])
			mt := entry{first, second}
			hr = append(hr, mt)
		}
		scanner.Scan()
		m, _ := strconv.Atoi(scanner.Text())
		for i := 0; i < m; i++ {
			scanner.Scan()
			buf := strings.Split(scanner.Text(), " ")
			first, _ := strconv.Atoi(buf[0])
			second, _ := strconv.Atoi(buf[1])
			mt := entry{first, second}
			hr = append(hr, mt)
		}
		sort.Sort(ByFirst(hr))
		fmt.Println(LIS(hr))
	}
}

type entry struct {
	first, second int
}

type ByFirst []entry

func(f ByFirst) Len() int {
	return len(f)
}

func (f ByFirst) Swap(i, j int) {
	f[i], f[j] = f[j], f[i]
}

func (f ByFirst) Less(i, j int) bool {
	return f[i].first < f[j].first
}

func LIS(hr []entry) int {
	n := len(hr)
	lis := make([]int, n)
	lis[n-1] = 1
	for i := n-2; i > -1; i-- {
		m := 0
		for j := i+1; j < n; j++ {
			if hr[i].first < hr[j].first && hr[i].second < hr[j].second && lis[j] > m {
				m = lis[j]
			}
		}
		lis[i] = m+1
	}
	return lis[0]
}

C++: #include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    while (true)
    {
        int n;
        cin>>n;
        if (n==0)
            break;
        vector<int> h(n), r(n);
        for (int i=0; i<n; i++)
            cin>>h[i]>>r[i];
        int m;
        cin>>m;
        h.resize(n+m);
        r.resize(n+m);
        for (int i=n; i<n+m; i++)
            cin>>h[i]>>r[i];

        vector<int> c(n+m, 1);
        for (int i=0; i<n+m; i++)
        for (int j=0; j<n+m; j++)
        for (int k=0; k<n+m; k++)
            if (h[k]<h[j] && r[k]<r[j])
                c[j] = max(c[j], c[k]+1);
        cout<<*max_element(c.begin(), c.end())<<endl;
    }
}

C++: #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#define ll long long int
#define ld long double
#define INF 1000000000
#define EPS 0.0000000001
#define rep(i,n) for(i=0;i<n;i++)
using namespace std;
typedef pair<int, int> P;

string str;

int main()
{
  int n,m;
  int i,j;
  int h,r;

  while(1){

    int doll[1005][1005]={};
    int dp[1005][1005]={};

    scanf("%d",&n);
    if(n==0)break;
    rep(i,n){
      scanf("%d %d",&h,&r);
      doll[h][r]=1;
    }

    scanf("%d",&m);
    rep(i,m){
      scanf("%d %d",&h,&r);
      doll[h][r]=1;
    }
  
    for(i=1;i<1001;i++){
      dp[i][1]=dp[i-1][1]+doll[i][1];
      for(j=2;j<1001;j++){
	dp[i][j]=max(dp[i-1][j],dp[i][j-1])+doll[i][j];
	if(doll[i][j]){
	  // printf("i=%d j=%d doll=%d\n",i,j,dp[i][j]);
	  for(int k=j+1;k<1001;k++)
	    dp[i][k]=dp[i][j];
	  break;
	}
      }
    }
 
    cout<<dp[1000][1000]<<endl;
  }
}

C++: #include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<int, int>;
 
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
 
template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }
 
template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) { 
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }
 
template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
  out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<typename T>
istream& operator >> (istream& is, vector<T>& vec){
  for(T& x: vec) {is >> x;} return is;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
  out<<'['; for(T i: a) {out<<i<<',';} out<<']'; return out;
}
 
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
ll MOD = 1000000007;

template <typename T>
class BIT {
private:
  vector<T> bit;
  int neutral = 0;
  // 更新クエリ, 区間クエリ
  function<T(T,T)> f = [](const T l, const T r) -> T { return max(l, r); },
                   g = [](const T l, const T r) -> T { return max(l, r); };
public:
  BIT(int n_ = 1e5) { init(n_); }
  void init(int n_ = 1e5) { bit.assign(n_+1, neutral); }
  void update(int i, T w) {
    for(int x = i+1; x < bit.size(); x += x&-x) bit[x] = f(bit[x], w);
  }
  // [0,i]
  T query(int i) {
    T ret = neutral;
    for(int x = i+1; x > 0; x -= x & -x) ret = g(ret, bit[x]);
    return ret;
  }
};

signed main(void)
{
  cin.tie(0);
  ios::sync_with_stdio(false);

  while(1) {
    ll n;
    cin >> n;
    if(!n) break;
    vector<PII> v(n);
    REP(i, n) cin >> v[i].first >> v[i].second;
    ll m;
    cin >> m;
    REP(i, m) {
      ll h, r;
      cin >> h >> r;
      v.push_back({h, r});
    }

    sort(ALL(v), [](PII l, PII r){
      if(l.first != r.first) return l.first < r.first;
      return l.second > r.second;
    });

    ll ret = 0;
    BIT<ll> bit;
    REP(i, n+m) {
      ll tmp = bit.query(v[i].second-1) + 1;
      bit.update(v[i].second, tmp);
      chmax(ret, tmp);
    }
    cout << ret << endl;
  }

  return 0;
}

C++: #include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;

typedef pair<int, int> doll;

int main()
{
	int n, m, i, j;
	vector<doll> vc;
	int dp[200];
	
	vc.reserve(200);
	
	while( cin >> n, n)
	{
		vc.clear();
		memset( dp, 0, sizeof(dp));
		
		for( i = 0; i < n; i++)
		{
			doll d;
			cin >> d.first >> d.second;
			vc.push_back(d);
		}
		
		cin >> m;
		
		for( i = 0; i < m; i++)
		{
			doll d;
			cin >> d.first >> d.second;
			vc.push_back(d);
		}
		
		std::sort(vc.begin(), vc.end());
		
		
		dp[0] = 1;
		int surface = 0;

		for( i = 1; i < n+m; i++)
		{
			if( vc[surface].first < vc[i].first && vc[surface].second < vc[i].second )
			{
				dp[i] = dp[i-1] + 1;
				surface = i;
			}
			else
			{
				dp[i] = dp[i-1];
			}
		}
		
		
		cout << dp[n+m-1] << endl;
	}
	
	return 0;
}

C++: #include<iostream>

using namespace std;

const int MAX = 201;

typedef struct{
  int h;
  int r;
}DOLL;

int dp[MAX];
DOLL data[MAX];
int m,n;

void Dsort(){
  for(int i = 0; i < m+n-1; i++){
    for(int j = i; j < m+n; j++){
      if(data[i].r > data[j].r && data[i].h > data[j].h){
	DOLL tmp  = data[i];
	data[i] = data[j];
	data[j] = tmp;
      }
    }
  }
}

int solve(){
  dp[1] = 1;
  DOLL now = data[0];
  for(int i = 2; i < m+n; i++){
    if(data[i].h > now.h && data[i].r > now.r){
      dp[i] = dp[i-1]+1;
      now = data[i];
    }else dp[i] = dp[i-1];
  }
  return dp[m+n-1]+1;
}


int main(){

  while(cin >> n && n){
    fill(dp,dp+MAX,0);
    for(int i = 0; i < n; i++) cin >> data[i].h >> data[i].r;
    cin >> m;
    for(int i = n; i < m+n; i++) cin >> data[i].h >> data[i].r;
    Dsort();
    cout << solve() << endl;
  }
  return 0;
}