Submission #7415

#	Time	Username	Problem	Language	Result	Execution time	Memory
7415		gs13068	사냥꾼 (KOI13_hunter)	C++98	100 / 100	80 ms	2260 KiB

hunter

#include<cstdio>
#include<algorithm>

int a[100000];
std::pair<int,int> b[100000];

int main()
{
  int i,j,n,m,l;
  scanf("%d%d%d",&n,&m,&l);
  for(i=0;i<n;i++)scanf("%d",&a[i]);
  for(j=0;j<m;j++)scanf("%d%d",&b[j].first,&b[j].second);
  std::sort(a,a+n);
  i=0;
  for(j=0;j<m;j++)if(std::lower_bound(a,a+n,b[j].first+b[j].second-l)<std::upper_bound(a,a+n,b[j].first-b[j].second+l))i++;
  printf("%d",i);
}

• Subtask 1: 10 / 10
• Subtask 2: 17 / 17
• Subtask 3: 21 / 21
• Subtask 4: 22 / 22
• Subtask 5: 30 / 30