HDU 1827

#include<stdio.h>
#include<string.h>
#include<stack>
#include<string>
#include<math.h>
#include<queue>
#include<set>
#include<algorithm>
#include<iostream>
#include<vector>
#include<map>
using namespace std;
#define LL long long
#define inf 1999999999
#define N 1005
#define max(a,b)(a>b?a:b)
#define min(a,b)(a<b?a:b)
vector<int>edge[N];
int low[N],belong[N],dfn[N],vis[N],In[N],cost[N];
stack<int>s;
int Index,num,sum,cnt;
void init()
{
    memset(low,0,sizeof(low));
    memset(dfn,0,sizeof(dfn));
    memset(vis,0,sizeof(vis));
    memset(In,0,sizeof(In));
    memset(belong,0,sizeof(belong));
    num=cnt=sum=Index=0;
    while(!s.empty()) s.pop();
}
void tarjan(int u)
{
	int v,i;
	low[u]=dfn[u]=++Index;
	s.push(u);
	vis[u]=1;
	for(i=0;i<edge[u].size();i++)
	{
		v=edge[u][i];
		if(dfn[v]==0)
		{
			tarjan(v);
			low[u]=min(low[u],low[v]);
		}
		else if(vis[v])
			low[u]=min(low[u],dfn[v]);
	}
	if(low[u]==dfn[u])
	{
		cnt++;
		while(1)
		{
			v=s.top();s.pop();
			belong[v]=cnt;
			vis[v]=0;
			if(v==u) break;
		}
	}
}

int main()
{
	int i,j,n,m,u,v;
	while(scanf("%d%d",&n,&m)!=-1)
	{
		for(i=1;i<=n;i++)edge[i].clear();
		init();
		for(i=1;i<=n;i++) scanf("%d",&cost[i]);
		for(i=1;i<=m;i++)
		{
			scanf("%d%d",&u,&v);
			edge[u].push_back(v);
		}
		for(i=1;i<=n;i++)
		{
			if(!dfn[i])
				tarjan(i);
		}

		for(u=1;u<=n;u++)
        {
            for(i=0;i<edge[u].size();i++)
            {
                v=edge[u][i];
                if(belong[u]!=belong[v])
                    In[belong[v]]++;
            }
        }
        for(i=1;i<=cnt;i++)
        {
            if(In[i]==0)
            {
                int tmp=inf;
                for(j=1;j<=n;j++)
                    if(belong[j]==i)
                        tmp=min(tmp,cost[j]);
                sum+=tmp;
                num++;
            }
        }
        printf("%d %d\n",num,sum);
    }
    return 0;
}