#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
const int MAX=2000;
struct node{
int x;
int y;
};
bool cmp(int a,int b){
return a>b;
}
int main(){
int n,k,t;
int xl,yd,xr,yu;
int go=0,jg=0,dl=0;
node path[MAX]={};
int time[MAX]={};
int tj=0;
cin>>n>>k>>t>>xl>>yd>>xr>>yu;
//scanf("%d %d %d %d %d %d %d",&n,&k,&t,&xl,&yd,&xr,&yu);
for(int i=0;i<n;i++){
for(int j=0;j<t;j++){
scanf("%d%d",&path[j].x,&path[j].y);
if(path[j].x>=xl&&path[j].x<=xr&&path[j].y>=yd&&path[j].y<=yu){
time[tj]++;
go=1;
}
else {
tj++;
}
}
sort(time,time+MAX,cmp);
if(time[0]>=k)dl++;
if(go==1)jg++;
go=0;
fill(time,time+MAX,0);
}
printf("%d\n%d",jg,dl);
return 0;
}
解决了啊哈哈哈
数组开小了= =
您好,我是问答小助手,看到您的问题已被解答,欢迎您加入CSDN!
目前问答VIP仅需29元,即可享受5次/月 有问必答服务,了解详情>>> https://vip.csdn.net/askvip?utm_source=1146287632