ZUFEOJ Home ProblemSet Source/Category Contest Status Ranklist F.A.Qs
Login Register

6021: Reconnaissance

内存限制：256 MB 时间限制：2 S
题面：传统 评测方式：文本比较 上传者：
提交：1 通过：1
提交提交记录统计Web Board

题目描述

A. Reconnaissance
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
According to the regulations of Berland's army, a reconnaissance unit should consist of exactly two soldiers. Since these two soldiers shouldn't differ much, their heights can differ by at most d centimeters. Captain Bob has n soldiers in his detachment. Their heights are a1,a2,...,an centimeters. Some soldiers are of the same height. Bob wants to know, how many ways exist to form a reconnaissance unit of two soldiers from his detachment.
Ways (1,2) and (2,1) should be regarded as different.
Input
The first line contains two integers n and d (1≤n≤1000,1≤d≤109) − amount of soldiers in Bob's detachment and the maximum allowed height difference respectively. The second line contains n space-separated integers − heights of all the soldiers in Bob's detachment. These numbers don't exceed 109.
Output
Output one number − amount of ways to form a reconnaissance unit of two soldiers, whose height difference doesn't exceed d.
Examples
Input 
5 10
10 20 50 60 65
Output 
6
Input 
5 1
55 30 29 31 55
Output 
6

输入样例 复制

输出样例 复制

分类标签