c语言求最接近数的问题

之前没考虑深层计算，改用递归可以遍历所有情况

#include <stdio.h>
//冒泡排序从高到低
void bubble_sort(int arr[], int len)
{
    int i, j, temp;
    for (i = 0; i < len - 1; i++)
        for (j = 0; j < len - 1 - i; j++)
            if (arr[j] < arr[j + 1])
            {
                temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
}
/*
* arr 从高到低排序 长度为n 前枝计算结果tsum 当前结果为msum
*/
void sfun(int *arr,int n,int tsum,int cc,int* msum)
{
    if((n<=0)||(*msum==cc))//查询到数组末尾或已经查询到结果退出搜索
    {
        return;
    }
    sfun(arr+1,n-1,tsum,cc,msum);//查找平行层
    if((tsum+*arr)<cc)
    {
        tsum+=*arr;
        if(*msum<tsum)
            *msum=tsum;
        sfun(arr+1,n-1,tsum,cc,msum);//查找下一层
    }
    else if((tsum+*arr)==cc)//查询到结果
    {
        *msum=cc;
    }
}
void fun(int arr[],int B,int C)
{
    int sum, maxsum, i;
    bubble_sort(arr, B);//冒泡排序 从高到低
    maxsum=arr[B-1];
    sum=0;
    for (i = B - 1; i >= 0; i--)
    {
        if (arr[i] < C)
        {
            sfun(arr,B,sum,C,&maxsum);//递归查询
            break;
        }
        else if (arr[i] == C)//当前元素满足结果直接退出
        {
            maxsum=C;
            break;
        }
    }
    printf("%d", maxsum);//输出结果
}

int main(int argc, char *argv[])
{
    int i, arr[10001];
    int B, C;
    scanf("%d %d", &C, &B);//输入数据
    for (i = 0; i < B; i++)
    {
        scanf("%d", arr + i);
    }
    fun(arr,B,C);//查询并输出
    return 0;
}

#include <stdio.h>
void bubble_sort(int arr[], int len)
{
    int i, j, temp;
    for (i = 0; i < len - 1; i++)
        for (j = 0; j < len - 1 - i; j++)
            if (arr[j] > arr[j + 1])
            {
                temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
}
void fun()
{

    int k, i, arr[10001], sum, maxsum, j;
    int B, C;
    scanf("%d %d", &C, &B);
    for (i = 0; i < B; i++)
    {
        scanf("%d", arr + i);
    }
    bubble_sort(arr, B);
    maxsum=arr[0];
    for (i = B - 1; i >= 0; i--)
    {
        if (arr[i] < C)
        {
            for(k = 1; k <= i; k++)
            {
                sum = arr[i];
                for (j = i - k; j >= 0; j--)
                {
                    if ((sum + arr[j]) <= C)
                    {
                        sum += arr[j];
                        if (sum == C)
                        {
                            printf("%d", C);
                            return;
                        }
                    }
                }
                if(sum>maxsum)
                    maxsum=sum;
            }
        }
        else if (arr[i] == C)
        {
            printf("%d", C);
            return;
        }
    }
    printf("%d", maxsum);
}

int main(int argc, char *argv[])
{
    fun();
    return 0;
}