D26: the nearest number (translation + solution)

The original title is ：OpenJudge - 26:The Nearest Number

translate ：

describe ： Given a N Sequence sum of numbers K. Find the sequence with the lowest subscript and K Nearest （X-K The absolute value of is the smallest ） Number of numbers X;

Input ： first line ： Two positive integers N、K（N<=100、K<=100000);

Output ： An integer X.

Code ：

#include<iostream>
#include<cmath>
using namespace std;
int main()
{
	int n,k;
	cin>>n>>k;
	int a,i,mina,minc=100000;
	for(i=1;i<=n;i++){
		cin>>a;
		if(abs(a-k)<minc){
			mina=a;
			minc=abs(a-k);
		}
	}
	cout<<mina;
	return 0;
}