K Closest Number
1234567891011121314151617181920212223242526272829303132333435363738
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int k;
cin>>k;
int x;
cin>>x;
int n;
cin>>n;
int A[n];
for(int i=0 ; i<n; i++){
cin>>A[i];
}
priority_queue<pair<int,int>> maxh;
for(int i=0; i<n; i++){
maxh.push( {abs(A[i]-x) , A[i]} );
if(maxh.size()>k)
maxh.pop();
}
while(k>0){
cout<<maxh.top().second<<" ";
maxh.pop();
k--;
}
}
Cpp
INFO