rt.

爆零了 /kk

https://www.luogu.com.cn/record/225831874

#include<bits/stdc++.h>
using namespace std;
struct fish{
    int id,x,nth;
}a[1005],b[1005];
bool cmp(fish x,fish y){
    if(x.x==y.x)return x.nth>y.nth;
    return x.x<y.x;
}
bool mp[1005];
int awa[1005];
void solve(){
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    b[i]=a[i]={0,0},awa[i]=mp[i]=0;
    for(int i=1;i<=n;i++)
    scanf("%d%d",&b[i].x,&a[i].x),a[i].id=i,
    a[i].nth=b[i].x,b[i].nth=a[i].x;
    sort(a+1,a+1+n,cmp);
    for(int i=1;i<=n;i++)
    b[a[i].id].id=i;
    sort(b+1,b+1+n,cmp);
    int flc=0,qwq=1,twt=0;
    for(int i=1;i<=n;i++){
        while(flc<a[i].x&&qwq<=n){
            if(mp[b[qwq].id]){
                qwq++;
                continue;
            }
            twt++;
            if(flc>=b[qwq].x)flc++,awa[b[qwq].id]=1,qwq++;
            else{
                puts("Too Bad");
                return;
            }
        }
        if(flc<a[i].x){
            puts("Too Bad");
            return;
        }
        mp[i]=1;
        flc+=2-awa[i];
    }
    printf("%d\n",twt+n);
}
int main(){
    int t;
    scanf("%d",&t);
    for(int i=1;i<=t;i++)
    printf("Case #%d: ",i),solve();
    return 0;
}