jawaban-toki/Kompetitif Dasar/03. Pencarian dan Pengurutan/Kupon Berhadiah.cpp

27 lines
533 B
C++

#include <iostream>
#include <cmath>
#include <limits.h>
using namespace std;
int main() {
int n,x;
int diff[1000];
cin>>n>>x;
int min = INT_MAX;
int minDiff = INT_MAX;
int coupon[1000];
for (int i = 0; i<n; i++) {
cin>>coupon[i];
diff[i] = abs(x-coupon[i]);
if (diff[i]<minDiff) {
minDiff = diff[i];
min = INT_MAX;
}
if(diff[i]==minDiff && coupon[i]<min) {
min = coupon[i];
}
}
cout<<min<<endl;
return 0;
}