poj 3636 Nested Dolls

#include <cstdio>#include <algorithm>using namespace std;#define MAX_DOLL_NUM 20004struct Doll{    int width, height;}doll[MAX_DOLL_NUM], chain[MAX_DOLL_NUM];int doll_num;int chain_cnt;bool operator < (const Doll &a, const Doll &b){    if (a.width == b.width)        return a.height > b.height;    return a.width < b.width;}void input(){    scanf("%d", &doll_num);    for (int i = 0; i < doll_num; i++)        scanf("%d%d", &doll[i].width, &doll[i].height);}bool fit(Doll a, Doll b){    return a.width > b.width && a.height > b.height;}void work(){    chain_cnt = 0;    for (int i = 0; i < doll_num; i++)    {        bool fitted = false;        for (int j = 0; j < chain_cnt; j++) if (fit(doll[i], chain[j])) {     fitted = true;     chain[j] = doll[i];     break; }        if (!fitted)        { chain[chain_cnt++] = doll[i];        }    }}int main(){    int t;    scanf("%d", &t);    while (t--)    {        input();        sort(doll, doll + doll_num);        work();        printf("%dn", chain_cnt);    }    return 0;}