poj 3270 Cow Sorting

#include <cstdio>
#include <cstring>
#include <algorithm>
#define maxn 20000
using namespace std;

int min1=100000;
int n;
bool vis[maxn];
struct node
{
int num;
int id;
bool operator <(const node &a)const
{
return num<a.num;
}
}p[maxn*2];

int deal()
{
int ans=0;
for(int i=0; i<n; i++)
{
if(!vis[i])
{
vis[i]=true;
int sum=p[i].num;
int m1=p[i].num;
int t1=1;
int id=p[i].id;
while(id!=i)
{
vis[id]=true;
sum+=p[id].num;
m1=min(m1,p[id].num);
id=p[id].id;
t1++;
}
ans+=min(sum+(t1-2)*m1,sum+m1+(t1+1)*min1);
}
}
return ans;
}

int main()
{
while(scanf("%d",&n)!=EOF)
{
memset(vis,false,sizeof(vis));
for(int i=0; i<n; i++)
{
scanf("%d",&p[i].num);
p[i].id=i;
min1=min(min1,p[i].num);
}
sort(p,p+n);
printf("%d\n",deal());
}
return 0;
}