Translation D28 (with AC code POJ 26:the nearest number)

“ Ctrl AC！ Together AC！”

The original title is ：The Nearest Number

My translation ：

describe

Given N Sequence and number of numbers K. stay （X subtract K） Find the nearest number in the sequence with the smallest absolute value of X.

Input

first line ： Two positive integers N（N<=100） and K（K<=100000）. The second line ：N A positive integer （<=100000）.

Output

An integer X.

AC Code ：

include<bits/stdc++.h>
using namespace std;
int main(){
	int n,k;cin>>n>>k;
	int minn=0x3f3f3f3f;
	int ans=-1;
	for(int i=0;i<n;i++){
		int num;cin>>num;
		if(abs(num-k)<minn){
			ans=num;
			minn=abs(num-k);
		}
	}
	cout<<ans<<endl;
	return 0;
}

Thank you for reading ！！！

“ Ctrl AC！ Together AC！”