题目描述
题解
貌似和POJ3270是一样的。
代码
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int max_n=1e5+5;
const int INF=2e9;
int n,Max,Min,j,k,t,sum,ans;
int a[max_n],cnt[max_n];
bool used[max_n];
int main()
{
scanf("%d",&n);
Min=INF;
for (int i=1;i<=n;++i)
{
scanf("%d",&a[i]);
cnt[a[i]]++;
Max=max(Max,a[i]);
Min=min(Min,a[i]);
}
for (int i=1;i<=Max;++i)
cnt[i]+=cnt[i-1];
for (int i=1;i<=n;++i)
if (!used[i])
{
j=i;
k=sum=0;
t=a[j];
while (!used[j])
{
k++;
sum+=a[j];
t=min(t,a[j]);
used[j]=true;
j=cnt[a[j]];
}
if (1<k) ans+=sum;
if (2<k)
{
int tmp1=(k-2)*t;
int tmp2=(k+1)*Min+t;
ans+=min(tmp1,tmp2);
}
}
printf("%d\n",ans);
}