#include <iostream>
#include <vector>
#include <unordered_map>
#include <string>
#include <cmath>
using namespace std;
void print(vector<int>& a) {
for (int num:a) {
cout <<num << " ";
}
cout << endl;
}
void insertionSort(vector<int>& a, int n) {//{ 9,1,5,6,2,3 }
for (int i = 1; i < n; ++i) {
if (a[i] < a[i - 1]) { //若第i个元素大于i-1元素,直接插入。小于的话,移动有序表后插入
int j = i - 1;
int x = a[i]; //复制为哨兵,即存储待排序元素
//a[i] = a[i - 1]; //先后移一个元素,可以不要这一句,跟循环里面的功能重复了
while (j >= 0 && x < a[j]) { //查找在有序表的插入位置,还必须要保证j是>=0的 因为a[j]要合法
a[j + 1] = a[j];
j--; //元素后移
}
a[j + 1] = x; //插入到正确位置
}
}
print(a); //打印排序的结果
}
//丰疆智能一面
int findFirstNum(string& str) {
unordered_map<char,int> umap;
for (char& c : str) {
umap[c]++;
}
for (int i = 0; i < str.size(); i++) {
if (umap[str[i]] == 1) {
return i;
}
}
return -1;
}
//蔚来笔试2022.8.4
void weilai1() {
int n;
cin >> n;
vector<int> arr1;
for (int i = 0; i < n; i++) {
int temp1;
cin >> temp1;
arr1.push_back(temp1);
}
int m;
cin >> m;
vector<int> arr2;
for (int i = 0; i < n; i++) {
int temp2;
cin >> temp2;
arr2.push_back(temp2);
}
for (int& num : arr2) {
int sum = 0;
for (int i = 0; i < arr1.size(); i++) {
int k = arr1[i] + num;
sum += abs(k);
arr1[i] += abs(k);
}
cout << sum << endl;
}
}
// JZ66 构建乘积数组
void conProductionArr() {
vector<int> A{10,5,71,10,4,1,5,4,1};
int n = A.size();
vector<int> B(n, 1);
for (int i = 1; i < n; i++) {
B[i] = B[i - 1] * A[i - 1];
}
int temp = 1;
for (int i = B.size()-1; i >= 0; i--) {
B[i] = B[i] * temp;
temp = temp * A[i];
}
for (int& num : B)
cout << num << " ";
}
//
void solution2() {
vector<float> arr = {1.0,2.0,30,4.0,5.0,6.2,7.9,8.1};
float num = 6.2;
float res = 10.0;
float dis = 10.0;
for (int i = 0; i < arr.size(); i++) {
if (abs(arr[i]-num) < dis) {
res = arr[i];
dis = abs(arr[i] - num);
}
}
cout << endl;
cout <<"::"<<res << endl;
}
int main()
{
vector<int> vec{ 10,15,55,3,2,5,4,78 };
int n = vec.size();
//insertionSort(vec,n);
//conProductionArr();
cout << "Hello World!\n";
//weilai1();
solution2();
return 0;
}