Problem
Pashmak decided to give Parmida a pair of flowers from the garden. There are n flowers in the garden and the i-th of them has a beauty number bi. Parmida is a very strange girl so she doesn’t want to have the two most beautiful flowers necessarily. She wants to have those pairs of flowers that their beauty difference is maximal possible!
Your task is to write a program which calculates two things:
The maximum beauty difference of flowers that Pashmak can give to Parmida.
The number of ways that Pashmak can pick the flowers. Two ways are considered different if and only if there is at least one flower that is chosen in the first way and not chosen in the second way.
Input
The first line of the input contains n (2 ≤ n ≤ 2·10^5). In the next line there are n space-separated integers b1, b2, …, bn (1 ≤ bi ≤ 10^9).
Output
The only line of output should contain two integers. The maximum beauty difference and the number of ways this may happen, respectively.
Examples
input
2
1 2
output
1 1
input
3
1 4 5
output
4 1
input
5
3 1 2 3 1
output
2 4
Note
In the third sample the maximum beauty difference is 2 and there are 4 ways to do this:
choosing the first and the second flowers;
choosing the first and the fifth flowers;
choosing the fourth and the second flowers;
choosing the fourth and the fifth flowers.
题目大致意思为:有一串数字 找出最大值和最小值的个数 求最大值和最小值的差和两者出现次数的乘积
#include<iostream>
#include<algorithm>
#include<string.h>
#include<vector>
#include<stdio.h>
#include<limits.h>
#include<cmath>
#include<set>
#include<map>
#define ll long long
using namespace std;
int main()
{
int n;
cin >> n;
vector<int>v;
for (int i = 0; i < n; i++)
{
int x;
cin >> x;
v.emplace_back(x);
}
sort(v.begin(), v.end());
int maxn = v[n - 1];
int minn = v[0];
int maxcnt = 0;
int mincnt = 0;
if (maxn == minn)//这里要注意如果全是相同数字时 乘积是n * (n - 1) / 2
{
cout << maxn - minn << " " << 1ll * n * (n - 1) / 2 << endl;
return 0;
}
for (int i = 0; i < n; i++)
{
if (v[i] == maxn)
{
maxcnt++;
}
if (v[i] == minn)
{
mincnt++;
}
}
int res = maxn - minn;
ll mul = 1ll * maxcnt * mincnt;
cout << res << " " << mul << endl;
return 0;
}