http://www.lydsy.com/JudgeOnline/problem.php?id=1697
hehe裸置换群
//#define _TEST _TEST
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
/************************************************
Code By willinglive Blog:http://willinglive.cf
************************************************/
#define rep(i,l,r) for(int i=(l),___t=(r);i<=___t;i++)
#define per(i,r,l) for(int i=(r),___t=(l);i>=___t;i--)
#define MS(arr,x) memset(arr,x,sizeof(arr))
#define LL long long
#define INE(i,u,e) for(int i=head[u];~i;i=e[i].next)
inline const int read()
{int r=0,k=1;char c=getchar();for(;c<'0'||c>'9';c=getchar())if(c=='-')k=-1;
for(;c>='0'&&c<='9';c=getchar())r=r*10+c-'0';return k*r;}
/
int n;
vector<pair<int,int> >a;
/
/
void input()
{
n=read();
rep(i,0,n-1)
{
int x=read();
a.push_back(make_pair(x,i));
}
}
void solve()
{
sort(a.begin(),a.end());
int ans=0,m=a[0].first;
rep(i,0,n-1) if(~a[i].second)
{
int w=a[i].first,sz=0;
int tmp;
for(int j=i;~a[j].second;j=tmp)
{
ans+=a[j].first;
tmp=a[j].second;
a[j].second=-1;
sz++;
}
ans+=min((sz-2)*w,sz*m+m+w);
}
cout<<ans<<endl;
}
/
int main()
{
#ifndef _TEST
freopen("std.in","r",stdin); freopen("std.out","w",stdout);
#endif
input(),solve();
return 0;
}