pipioj 1023: 巨人排队（贪心）

http://www.pipioj.online/problem.php?id=1023

每次把当前的放在能排的当中最矮的一队里就ok

#define IO std::ios::sync_with_stdio(0);
#define bug(x)  cout<<#x<<" is "<<x<<endl
#include <bits/stdc++.h>
#define iter ::iterator
using namespace  std;
typedef long long ll;
typedef pair<int,int>P;
#define pb push_back
#define mk make_pair
#define se second
#define fi first
#define rs o*2+1
#define ls o*2
const ll mod=1e9+7;
const int N=2e5+5,M=3e6;

int n;

multiset<int>s;

int main(){
    while(~scanf("%d",&n)){
        s.clear();
        multiset<int>::iterator it;
        int ans=1;
        for(int i=1;i<=n;i++){
            int x;
            scanf("%d",&x);
            if(s.empty()){
                s.insert(x);
            }
            it=s.lower_bound(x);
            if(it==s.end()){
                ans++;
                s.insert(x);
            }
            else{
                s.erase(it);
                s.insert(x);
            }
        }
        printf("%d
",ans);
    }

}