#include<bits/stdc++.h>
using namespace std;
int countPairs(vector<int>&b,int k){
unordered_map<int,int>f;
int cnt=0;
for(int i=0;i<b.size();i++){
int complement=k-b[i];
if(f.find(complement)!=f.end())cnt+=f[complement];
f[b[i]]++;
}
return cnt;
}
int main(){
vector<int>b={1,2,3,4,3};int k=6;
cout<<countPairs(b,k)<<"\n";
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKaW50IGNvdW50UGFpcnModmVjdG9yPGludD4mYixpbnQgayl7CiAgICB1bm9yZGVyZWRfbWFwPGludCxpbnQ+ZjsKICAgIGludCBjbnQ9MDsKICAgIGZvcihpbnQgaT0wO2k8Yi5zaXplKCk7aSsrKXsKICAgICAgICBpbnQgY29tcGxlbWVudD1rLWJbaV07CiAgICAgICAgaWYoZi5maW5kKGNvbXBsZW1lbnQpIT1mLmVuZCgpKWNudCs9Zltjb21wbGVtZW50XTsKICAgICAgICBmW2JbaV1dKys7CiAgICB9CiAgICByZXR1cm4gY250Owp9CmludCBtYWluKCl7CiAgICB2ZWN0b3I8aW50PmI9ezEsMiwzLDQsM307aW50IGs9NjsKICAgIGNvdXQ8PGNvdW50UGFpcnMoYixrKTw8IlxuIjsKICAgIHJldHVybiAwOwp9Cg==