【C语言指南】求一个数组中两个元素a和b的和最接近整数m

//求一个数组中两个元素a和b的和最接近整数m
#include<stdio.h>
#include<limits.h>
int a = 0, b = 0;//全局变量
void fun(int* arr, int numsSize,int m)
{
    int left = 0;//左指针
    int right = numsSize - 1;//右指针
    int min_diff = INT_MAX;//存储最小差值
    while (left <= right)
    {
        int sum = arr[left] + arr[right];
        if (sum == m)//如果元素和等于m，直接返回
        {
            a = arr[left];
            b = arr[right];
            return;
        }
        int tmp_diff = abs(sum - m);//存储当前差值
        if (tmp_diff < min_diff)//如果当前元素更接近，更新数据
        {
            min_diff = tmp_diff;
            a = arr[left];
            b = arr[right];
        }
        if (sum > m)
            right--;
        if (sum < m)
            left++;
    }
}

int main()
{
    int arr[] = { 2,4,6,8,10,11,14,16,18 };
    int sz = sizeof(arr) / sizeof(arr[0]);
    int m = 13;
    fun(arr, sz, m);
    printf("最接近整数m=%d的a和b的值是%d,%d\n", m, a, b);
    return 0;
}