团体程序设计天梯赛 L1-088 静静的推荐

#include<bits/stdc++.h>
using namespace std;
int bb[1010];
typedef struct
{
    int x,y;
} Q;
Q q[101010];
bool cmp(Q a,Q b)
{
    if(a.x!=b.x)
        return a.x<b.x;
    return a.y<b.y;
}
int book[101010];
int main()
{
    int n,k,s,i=0;
    cin>>n>>k>>s;
    for(int i=0; i<n; i++)
        cin>>q[i].x>>q[i].y;
    sort(q,q+n,cmp);
    int sum=0;
    for(int i=0; i<n; i++)
    {
        if(q[i].x>=175&&q[i].y>=s)
        {
            book[i]=1;
            sum++;
            q[i].x=i-1000;
        }
    }
    for(int i=0; i<n; i++)
    {
        if(book[i]==0)
            bb[q[i].x]++;
    }
    for(i=175; i<=290; i++)
    {
        if(bb[i]<=k)
        {
            sum+=bb[i];
        }
        else
            sum+=k;
    }
    cout<<sum<<endl;
}