求助， 92分 #4 TLE

#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
long long int n, c, m[200005], ans[2][200005] = { 0 }, s = 0, ch;
long long int x = 0;
long long int f(int a)
{
    long long int k = c + ans[0][a];
    for (int i = ch; i < s; i++)
    {
        if (ans[0][i] == k)
        {
            ch = i;
            return ans[1][i] * ans[1][a];
        }
    }
    return 0;
}
int main()
{
    cin >> n >> c;
    for (int i = 0; i < n; i++)
    {
        scanf("%lld", &m[i]);
    }
    sort(m, n + m);
    ans[0][0] = m[0];
    ans[1][0] = 1;
    for (int i = 1; i < n; i++)
    {
        if (m[i] == m[i - 1])
        {
            ans[1][s]++;
        }
        else
        {
            ans[0][++s] = m[i];
            ans[1][s] = 1;
        }
    }
    s++;
    ch = 0;
    for (int i = 0; i < s; i++)
    {
        x += f(i);
    }
    cout << x;
    return 0;
}