题目链接
dfs连通块
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
const int maxn=1e5+5;
vector <int> g[maxn];
bool vis[maxn];
int a[maxn];
#define ll long long
ll rs[maxn];
ll ans=0,sum=0;
void dfs(int x)
{
vis[x]=1;
sum+=a[x];
for(int i=0;i<g[x].size();i++)
{
int y=g[x][i];
if(!vis[y])
{
dfs(y);
}
}
}
int main()
{
int n,m;
cin>>n>>m;
int k=0;
memset(rs,0,sizeof(rs));
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(int i=1;i<=n;i++)
{
int v;
cin>>v;
g[v].push_back(i);
g[i].push_back(v);
}
for(int i=1;i<=n;i++)
{
if(!vis[i])
{
sum=0;
dfs(i);
rs[k++]=sum;
}
}
sort(rs, rs+k);
reverse(rs, rs+k);
for(int i = 0; i < m; i++) ans += rs[i];
cout<<ans<<endl;
return 0;
}