问题描述
给定一个排序排序好的组织,两个整数k和x,从数组中找到最靠近x(两数之差最小)的的k个数。
返回的结果必须要是按升序拍好的。
如果有两个数与x的差值一样,优先选择数值较小的那个数。
输入描述
第一行为排序好的数组arr
第二行为查找的个数k
第三行为基准值x
输出描述
按升序排好的数组
说明
k的值为整数,且总数小于给定排序数组的长度;
数组不为空,且长度不超过10^4;
数组里的每个元素的绝对值不超过个10^4.
案例1
输入
1,2,3,4,5
4
3
输出
1,2,3,4
程序
#include<iostream>
#include<cstdio>
#include<vector>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<limits.h>
using namespace std;
int main()
{
int N = 0;
int K = 0;
int x = 0;
vector <int>arr;
for (int i = 0; i < 10^4; i++)
{
arr.insert(arr.begin() + i, 0);
cin >> arr[i];
if (abs(arr[i]) > (10^4))
{
cout <<"Error arr["<< i << "] = " << arr[i] << endl;
return -1;
}
if (getchar() == '\n')
break;
}
N = arr.size();
cin >> K;
if (K <= 0 || K >= N)
{
cout << "Error K = " << K << endl;
return -1;
}
cin >> x;
if (abs(x) > (10^4)) {
cout << "Error x = " << x << endl;
return -1;
}
vector <int> out(1, 0);
int min_diff = INT_MAX;
int nearest_i = 0;
for(int i = 0; i < N; i++)
{
int temp_diff = abs(arr[i] - x);
if(temp_diff < min_diff)
{
min_diff = temp_diff;
nearest_i = i;
}
}
out[0] = arr[nearest_i];
int left = nearest_i - 1;
int right = nearest_i + 1;
int k = 1;
do {
if (left >= 0 && right <= N-1)
{
if (x - arr[left] <= arr[right] - x)
{
out.push_back(arr[left]);
left --;
k ++;
}
else
{
out.push_back(arr[right]);
right ++;
k ++;
}
}
else if (left < 0 && right <= N-1)
{
out.push_back(arr[right]);
right ++;
k ++;
}
else if (right > N-1 && left >= 0)
{
out.push_back(arr[left]);
left --;
k ++;
} else{
cout << "Error!" << "k =" << k << "left = " << left << "right = " << right << endl;
return -1;
}
} while (k < K);
sort(out.begin(), out.end());
for ( int i = 0; i < K; i ++)
{
cout<< out[i];
if (i < K-1)
cout << ",";
}
cout << endl;
return 0;
}