无有因，得0分何故

#include<bits/stdc++.h>
using namespace std;
int a[15],b[15];
int k[15];
int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    cin>>a[i],k[i]=i;
    for(int i=1;i<=n;i++)
    cin>>b[i];
    int minn=1e9;
    do
    {
        int s=n;
        for(int i=1;i<n;i++)
        s+=max(a[i],b[i+1]);
        minn=min(s,minn);
    }while(next_permutation(k+1,k+n+1));
    cout<<minn;
    return 0;
}