2022“杭电杯”中国大学生算法设计超级联赛（3） Package Delivery

#include<bits/stdc++.h>

using namespace std;

#define X first
#define Y second
#define eps  1e-2
#define gcd __gcd
#define pb push_back
#define PI acos(-1.0)
#define lowbit(x) (x)&(-x)
#define bug printf("!!!!!\n");
#define mem(x,y) memset(x,y,sizeof(x))

typedef long long LL;
typedef long double LD;
typedef pair<int,int> pii;
typedef unsigned long long uLL;

// #define int long long 

const int maxn = 1e5+2;
const int INF  = 1<<30;
const int mod  = 1e9+7;

int n,k;
pair<int,int> p[maxn];

struct  node
{
    int v;
    bool operator<(const node B) const{
        return v>B.v;
    }
};
priority_queue<node> q;
void solve(){
    while(q.size()) q.pop();
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++) scanf("%d%d",&p[i].first,&p[i].second);
    sort(p+1,p+1+n);
    int ans=0;
    for(int i=1;i<=n;i++){
        if(q.size()==0||q.top().v>=p[i].first) q.push({p[i].second});
        else if(q.top().v<p[i].first){
            while(q.size()&&q.top().v<p[i].first){
                for(int j=1;j<=k;j++){
                    if(q.size()==0) break;
                    q.pop();
                }++ans;
            }
            q.push({p[i].second});
        }
    }
    if(q.size()) ans+=(q.size()-1)/k+1;
    cout<<ans<<endl;
    return;
}

int32_t main()
{
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
//    ios::sync_with_stdio(false);
    // priority_queue<int> q;
    // q.push({1});q.push({2});
    // cout<<q.top().v<<endl;
    int t = 1;
    scanf("%d",&t);
    while(t--){
    //    printf("Case %d: ",cas++);
        solve();
    }
    return 0;
}