Stores TASK_135

#include<stdio.h>

double min(double a,double b){
    return a<b?a:b;
}

double cal(double sumall,double sum1,double sum2,double c1,double c2,int i,int arr1[],int arr2[],int n){
    if(i == n){
        return sumall;
    }
    double b1 = cal(sumall + (double)arr1[i],(double)arr1[i]+sum1,sum2,c1+1,c2,i+1,arr1,arr2,n);
    printf("Test b1 : %.2lf\n",b1);
    double b2 = cal(sumall + (double)arr2[i],sum1,(double)arr2[i]+sum2,c1,c2+1,i+1,arr1,arr2,n);
    printf("Test b2 : %.2lf\n",b2);
    return min(b1,b2);
}

int main()
{
    int n;
    scanf("%d",&n);
    int arr1[n];for(int i=0;i<n;i++)scanf("%d",&arr1[i]);
    int arr2[n];for(int i=0;i<n;i++)scanf("%d",&arr2[i]);

    printf("%.2lf",cal(0,0,0,0,0,0,arr1,arr2,n));
}