悬关
查看原帖
悬关
984127
dlx_OIer楼主2024/8/28 16:15
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n , a[1005] , b[1005] , p[1005] , ans = INT_MAX;
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n;
    for (int i = 1;i <= n;i++)
    {
        cin >> a[i] >> b[i];
        p[i] = i;
    }
    do
    {
        int s = 0;
        for (int i = 1;i < n;i++)
        {
            s += max(b[p[i]] , a[p[i + 1]]);
        }
        ans = min(ans , s + n);
    }while (next_permutation(p + 1 , p + n + 1));
    cout << ans;
	return 0;
}

2024/8/28 16:15
加载中...