#include <algorithm>
#include <cstdio>
#define N 100005
using namespace std;

struct node
{
    int x,y,opt;
    bool operator<(node a)const
    {
        if(opt!=a.opt&&x==a.x) return opt>a.opt;
        else return x<a.x;
    }
}card[N<<];
];
inline void pushup(int rt)
{
    ],r=ch[rt][];
    siz[rt]=siz[l]+siz[r]+cnt[rt];
}
inline void ins(int &rt,int x)
{
    if(!rt)
    {
        rt=++cn;
        data[cn]=x;
        siz[cn]=cnt[cn]=;
        return;
    }
    if(data[rt]==x)
    {
        cnt[rt]++;
        siz[rt]++;
        return;
    }
    if(x<data[rt])
    {
        ins(ch[rt][],x);
        fa[ch[rt][]]=rt;
        pushup(rt);
    }
    else
    {
        ins(ch[rt][],x);
        fa[ch[rt][]]=rt;
        pushup(rt);
    }
}
int ask_pre(int rt,int x)
{
    int p=rt,ret=0x7fffffff;
    while(p)
    {
        ];
        else
        {
            ret=data[p];
            p=ch[p][];
        }
    }
    return ret;
}
inline ]==x;}
void rotate(int x)
{
    int y=fa[x],z=fa[y],b=son(x),c=son(y),a=ch[x][!b];
    if(z) ch[z][c]=x;
    else root=x;
    fa[x]=z;
    if(a) fa[a]=y;
    ch[x][!b]=y;ch[y][b]=a;
    fa[y]=x;
    pushup(y);pushup(x);
}
void splay(int x,int i)
{
    while(fa[x]!=i)
    {
        int y=fa[x],z=fa[y];
        if(z==i) rotate(x);
        else
        {
            if(son(y)==son(x)) rotate(y),rotate(x);
            else rotate(x),rotate(x);
        }
    }
}
int getmn(int rt)
{
    ,p=rt;
    while(p)
    {
        ret=p;
        p=ch[p][];
    }
    return ret;
}
void del(int rt,int x)
{
    if(data[rt]==x)
    {
        )
        {
            cnt[rt]--;
            siz[rt]--;
        }
        else
        {
            splay(rt,);
            ]);
            )
            {
                splay(p,rt);
                root=p;fa[p]=;
                ch[p][]=ch[rt][];
                fa[ch[rt][]]=p;
            }
            else
            {
                root=ch[rt][];
                fa[ch[rt][]]=;
            }
        }
        return;
    }
    if(x<data[rt])
    {
        del(ch[rt][],x);
        pushup(rt);
    }
    else
    {
        del(ch[rt][],x);
        pushup(rt);
    }
}
int main(int argc,char *argv[])
{
    freopen("water.in","r",stdin);
    freopen("water.out","w",stdout);
    scanf("%d",&n);
    ;i<=n;++i) scanf(;
    ;i<=n<<;++i) scanf(;
    sort(card+,card++n*);
    ;i<=n<<;++i)
    {
        ) ins(root,card[i].y);
        else
        {
            if(!cn) continue;
            int v=ask_pre(root,card[i].y);
            if(v==0x7fffffff) continue;
            ans++;
            del(root,v);
        }
    }
    printf("%d\n",ans);
    fclose(stdin); fclose(stdout);
    ;
}

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int n;
multiset <int> s;
],b[];
int cmp(node i,node j) {return i.x<j.x;}
int main()
{
    freopen("water.in","r",stdin);
    freopen("water.out","w",stdout);
    int T;
    T=;
    while(T--)
    {
        scanf("%d",&n);
        ;i<n;i++) scanf("%d%d",&a[i].x,&a[i].y);
        ;i<n;i++) scanf("%d%d",&b[i].x,&b[i].y);
        sort(a,a+n,cmp);
        sort(b,b+n,cmp);
        s.clear();
        ,ans=;
        ;i<n;i++)
        {
            while(a[i].x>=b[k].x&&k<n)
            {
                 s.insert(b[k].y);
                 k++;
            }
            if(s.empty())continue;
            multiset<int>::iterator it=s.upper_bound(a[i].y);
            if (it==s.begin()) continue; it--;
            ans++; s.erase(it);
        }
        printf("%d\n",ans);
    }
    ;
}

#include <cstdio>
#include <cmath>
#define N 1005

inline int min(int a,int b) {return a>b?b:a;}
int n,s,ans,f[N][N],dp[N][N];
int main(int argc,char *argv[])
{
    freopen("dream.in","r",stdin);
    freopen("dream.out","w",stdout);
    scanf("%d",&n);
    s=log2(n)+;
    f[][]=;
    ;i<s;++i)
    {
        ;j<=n;++j)
         ;k<=n;++k)
          if(f[j][k])
           ;l<=j+;++l)
            dp[min(n,j+l)][l]+=f[j][k];
        ;j<=n;++j)
         ;k<=n;++k)
          f[j][k]=dp[j][k],dp[j][k]=;
    }
    ;i<=n;++i) ans+=f[n][i];
    printf("%d %d\n",s,ans);
    fclose(stdin);
    fclose(stdout);
    ;
}

#include <cstdio>
#define N 100005
typedef long long LL;
int n,k,L,R,a[N],s[N];
LL sum,f[N],g[N];
void update(int x,int type)
{
    ) sum+=s[a[x]],++s[a[x]];
    else --s[a[x]],sum-=s[a[x]];
}
void move(int l,int r)
{
    );
    );
    );
    );
}
void work(int l,int r,int fl,int fr)
{
    if(fl>fr) return;
    ,mi;
    LL mx=1LL<<;
    for(int i=l;i<mid&&i<=r;++i)
    {
        move(i+,mid);
        if(mx>f[i]+sum) mx=f[i]+sum,mi=i;
    }
    g[mid]=mx;
    work(l,mi,fl,mid-);
    work(mi,r,mid+,fr);
}
int main(int argc,char *argv[])
{
    freopen("dp.in","r",stdin);
    freopen("dp.out","w",stdout);
    scanf("%d%d",&n,&k);
    ;i<=n;++i) scanf("%d",&a[i]);
    f[]=;
    ;i<=n;++i) f[i]=1LL<<;
    while(k--)
    {
        L=,R=,sum=;
        ;i<=n;++i) s[i]=;
        work(,n-,,n);
        ;i<=n;++i) f[i]=g[i],g[i]=;
    }
    printf("%I64d\n",f[n]);
    fclose(stdin); fclose(stdout);
    ;
}