criyle/codenet-compile-errors huggingface dataset:
Language: C++

#include "taichitary.h"
#define V_MAX 100
#define INFTY 5000
#define WHITE 0
#define GRAY 1
#define BLACK 2

int M[V_MAX][V_MAX];
int d[V_MAX], p[V_MAX];
int n;
int color[V_MAX];

int Prim(int u){
    p[u] = -1; //p??????????????????????¨????

    for(int i=0; i<n; i++){
        d[i] = INFTY;
        p[i] = -1;
        color[i] = WHITE;
    }

    d[u] = 0; //d?????????????????????

    while(1){
        int mincost = INFTY;
        int from = -1;

        //??????????????§???????°?????????¨??????????¨???¶????????????
        for(int i=0; i<n; i++){
            if(color[i] != BLACK && d[i] < mincost){
                mincost = d[i];
                from = i;
            }
        }

        if(from == -1) break;

        color[from] = BLACK;

        for(int v=0; v<n; v++){
            if(color[v] != BLACK && M[from][v] != INFTY){
                if(M[from][v] < d[v]){
                    d[v] = M[from][v];
                    p[v] = from; //???????¨??????????
                    color[v] = GRAY;
                }
            }
        }
    }

    int sum = 0;

    for(int j=0; j<n; j++){
       if(p[j] != -1) sum += M[j][p[j]];
    }

    return sum;
}

int main(){

    cin >> n;

    for(int k=0; k<n; k++) color[k] = WHITE;

    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            int tmp;
            cin >> tmp;
            if(tmp != -1) M[i][j] = tmp;
            else M[i][j] = INFTY;
        }
    }

    int sum = Prim(0);

    cout << sum << endl;
}

Compiler output:
a.cc:1:10: fatal error: taichitary.h: No such file or directory
    1 | #include "taichitary.h"
      |          ^~~~~~~~~~~~~~
compilation terminated.
Language: C++

#include<iostream>
using namespace std;
static const int MAX = 100;
static const int INFTY = (1 << 21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n, M[MAX][MAX];

int prim() {
	int u, minv;
	int d[MAX], p[MAX], color[MAX];
	
	for(int i = 0; i < n; i++) {
		d[i] = INFTY;
		p[i] = -1;
		color[i] = WHITE;
	}
	
	d[0] = 0;
	
	while(1) {
		minv = INFTY;
		u = -1;
		for(int i = 0; i < n; i++) {
			if(minv > d[i] && color[i] != BLACK) {
				u = i;
				minv = d[i];
			}
		}
	   if(u == -1) break;
	   color[u] = BLACK;
	   for(int v = 0; v < n; v++) {
           if(color[v] != BLACK && M[u][v] != INFTY){
		   	  if(d[v] > M[u][v]) {
	   		      d[v] = M[u][v];
   		          p[v] = u;
           	   	  color[v] = GRAY;
   	           }
           }
   	   }	
	}
	int sum = 0; 
	for(int i = 0; i < n; i++) {
		if(p[i] != -1) sum += M[i][p[i]];
	}
} 

int main() {
	cin >> n;
	
	for(int i = 0; i < n; i++) {
		for(int i = 0; i < n; i++){
			int e;
			cin >> e;
			M[i][j] = (e == -1) ? INFTY :e;
		}
	}
	
	cout << prim();
	
	return 0;
}

Compiler output:
a.cc: In function 'int prim()':
a.cc:48:1: warning: no return statement in function returning non-void [-Wreturn-type]
   48 | }
      | ^
a.cc: In function 'int main()':
a.cc:57:30: error: 'j' was not declared in this scope
   57 |                         M[i][j] = (e == -1) ? INFTY :e;
      |                              ^
Language: C++

#include<iostream>
#include<vector>
#include<algorithm>
#define PII pair<int,int>
#define MPII(a,b) make_pair(a,b)
using namespace std;
class NODE
{
public:
	vector<PII> v;
	int index = 0;
};
class Tree
{
public:
	vector<int> V;
	int cost = 0;
};

int main()
{
	NODE* nodes;
	nodes = new NODE[101];
	Tree T;
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			int t;
			cin >> t;
			if (t != -1)
			{
				PII p = MPII(t, j);
				nodes[i].v.push_back(p);
			}
		}
		sort(nodes[i].v.begin(), nodes[i].v.end());
	}
	T.V.push_back(1);
	while (1)
	{
		if (T.V.size() == n+1)break;
		int mincost=INT_MAX;
		int addv=-1;
		int index;
		for (auto itr : T.V)
		{
			if (mincost >= nodes[itr].v[nodes[itr].index].first)
			{
				mincost = nodes[itr].v[nodes[itr].index].first;
				addv = nodes[itr].v[nodes[itr].index].second;
				index = itr;
			}
		}
		nodes[index].index++;
		T.V.push_back(addv);
		T.cost += mincost;
	}
	cout << T.cost << endl;
	delete[] nodes;
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:45:29: error: 'INT_MAX' was not declared in this scope
   45 |                 int mincost=INT_MAX;
      |                             ^~~~~~~
a.cc:4:1: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
    3 | #include<algorithm>
  +++ |+#include <climits>
    4 | #define PII pair<int,int>
Language: C++

#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
//#include "MyMath.h"
//#include "MyDisjointset.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <functional>
#include <stdio.h>
using namespace std;
typedef pair<int, int> P;
const int INF = 2000000000;
int main() {
	int n; cin >> n;
	int m[101][101];
	for (int i = 0; i < n; i++)for (int j = 0; j < n; j++)
		cin >> m[i][j];
	int res = 0;
	int *d = new int[n];
	fill(d, d + n, INF); 
	d[0] = 0;
	bool *visit = new bool [n];
	fill(visit, visit + n, false);
	priority_queue <P, vector<P>, greater<P> > q;
	q.push(P(d[0], 0));
	while (!q.empty()) {
		int f = q.top().first, s = q.top().second;
		visit[s] = true;
		res += f;
		q.pop();
		for (int i = 0; i < n; i++) {
			if (!visit[i]) {
				if (m[s][i] != -1) {
					if (m[s][i] < d[i]) {
						d[i] = m[s][i];
						q.push(P(d[i], i));
					}
				}
				}
			}
		}
	cout << res << endl;
	delete[] d, visit;
	return 0;

Compiler output:
a.cc: In function 'int main()':
a.cc:45:18: error: expected '}' at end of input
   45 |         return 0;
      |                  ^
a.cc:14:12: note: to match this '{'
   14 | int main() {
      |            ^
Language: C++

#include<iostream>
using namespace std;

const int MAX = 100;


int main() {
	int n;
	int graph[MAX][MAX];
	bool table[MAX] = { false };
	int sum = 0;

	cin >> n;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			int temp;
			cin >> temp;
			if (temp == -1)temp = INT_MAX;
			graph[i][j] = temp;
		}
	}

	table[0] = true;

	for (int i = 0; i < n - 1; i++) {
		int cost = INT_MAX;
		int m;

		for (int j = 0; j < n; j++) {
			if (table[j] == false)continue;

			for (int k = 0; k < n; k++) {
				if (graph[j][k] < cost && table[k] == false) {
					cost = graph[j][k];
					m = k;
				}
			}
		}

		sum += cost;
		table[m] = true;
	}

	cout << sum << endl;

	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:18:47: error: 'INT_MAX' was not declared in this scope
   18 |                         if (temp == -1)temp = INT_MAX;
      |                                               ^~~~~~~
a.cc:2:1: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
    1 | #include<iostream>
  +++ |+#include <climits>
    2 | using namespace std;
a.cc:26:28: error: 'INT_MAX' was not declared in this scope
   26 |                 int cost = INT_MAX;
      |                            ^~~~~~~
a.cc:26:28: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
Language: C++

#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define P(x) cout << (x) << '\n'
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i));
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
typedef long long ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
constexpr int MAX = 101;
constexpr int INF = 1<<21;
enum Color { WHITE = 0, GRAY, BLACK };
int n;
vv(int, M, MAX, MAX, INF);
inline int prim() {
	vi color(n, WHITE);
	int d[n];
	d[0] = 0;
	rep(i, 1, n) d[i] = INF;
    int minv, u;
    while(true) {
        minv = INF;
        u = -1;
        rep(i, 0, n) {
            if(minv > d[i] && color[i] != BLACK) {
                u = i;
                minv = d[i];
            }
        }
        if(u == -1) break;
        color[u] = BLACK;
        rep(v, 0, n) {
            if(color[v] != BLACK && d[v] > M[u][v]) {
                d[v] = M[u][v];
                color[v] = GRAY;
            }
        }
    }
    return accumulate(all(d), 0);
}
int main() {
    cin >> n;
    int e;
    rep(i, 0, n) {
        rep(j, 0, n) {
            cin >> e;
            if(e != -1) M[i][j] = e;
        }
    }
    P(prim());
    return 0;
}

Compiler output:
a.cc: In function 'int prim()':
a.cc:6:20: error: request for member 'begin' in 'd', which is of non-class type 'int [n]'
    6 | #define all(c) (c).begin(), (c).end()
      |                    ^~~~~
a.cc:49:23: note: in expansion of macro 'all'
   49 |     return accumulate(all(d), 0);
      |                       ^~~
a.cc:6:33: error: request for member 'end' in 'd', which is of non-class type 'int [n]'
    6 | #define all(c) (c).begin(), (c).end()
      |                                 ^~~
a.cc:49:23: note: in expansion of macro 'all'
   49 |     return accumulate(all(d), 0);
      |                       ^~~
Language: C++

#include <stdio.h>
#define INFTY 1000000
#define M -1
#define WHITE 0
#define GRAY  1
#define BLACK 2
#define N 100
int prim(void);
int n,A[N][N];

int main()
{
  int i,j,k;

  scanf("%d",&n);
  for(i=0;i<n;i++)
    {
      for(j=0;j<n;j++)
        {
          scanf("%d",&k);
          if(k==M) A[i][j]=INFTY;
        }
    }

  printf("%d\n",prim());
  return 0;
}

int prim()
{
  int d[N],p[N],color[N];
  int i,v,u,mincost,sum=0;

  for(i=0;i<n;i++)
    {
      d[i]=INFTY;
      p[i]=M;
      color[i]=WHITE;
    }
  d[0]=0;
while(1)
    {
      mincost=INFTY;
      u=M;
      for(i=0;i<n;i++)
        {
          if(color[i]!=BLACK&&d[i]<mincost)
            {
              u=i;
              mincost=d[i];
            }
        }
      if(u==M) break;
      color[u]=BLACK;
      for(v=0;v<n;v++)
        {
          if(color[v]!=BLACK&&A[u][v]!=INFTY)
            {
              if(d[v]>A[u][v])
                {
                  d[v]=A[u][v];
                  p[v]=u;
                  color[v]=GRAY;
                }
            }
        }
    }
  for(i=0;i<n;i++)
    {
      if(p[i]!=M) sum+=A[i][p[i]];
    }
  return sum;

Compiler output:
a.cc: In function 'int prim()':
a.cc:72:14: error: expected '}' at end of input
   72 |   return sum;
      |              ^
a.cc:30:1: note: to match this '{'
   30 | {
      | ^
Language: C++

#include <iostream>
using namespace std;
static const int MAX = 100;
static const int INFTY = (1 << 21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n, M[MAX][MAX];

int prim() {
	int u, minv;
	int d[MAX], p[MAX], color[MAX];
	for (int i = 0; i < n; i++)
	{
		d[i] = INFTY;
		p[i] = -1;
		color[i] = WHITE;
	}
	d[0] = 0;
	while (1)
	{
		minv = INFTY;
		u = i;
		minv = d[i];
		for (int i = 0; i < n; i++)
		{
			if (minv > d[i] && color[i] != BLACK) {
				u = i;
				minv = d[i];
			}
		}
		if (u == -1) break;
		color[u] = BLACK;
		for (int v = 0; v < n; v++)
		{
			if (d[v] > M[u][v]) {
				d[v] = M[u][v];
				p[v] = u;
				color[v] = GRAY;
			}
		}
		int sum = 0;
		for (int i = 0; i < n; i++)
		{
			if (p[i] != -1) sum += M[i][p[i]];
		}
	}
		return sum;
	}

	int main() {
		cin >> n;

		for (int i = 0; i < n; i++)
		{
			for (int j = 0; j < n; j++) {
				int e; cin >> e;
				M[i][j] = (e == -1) ? INFTY : e;
			}
		}
		cout << prim() << endl;
		return 0;
	}

Compiler output:
a.cc: In function 'int prim()':
a.cc:24:21: error: 'i' was not declared in this scope
   24 |                 u = i;
      |                     ^
a.cc:49:24: error: 'sum' was not declared in this scope
   49 |                 return sum;
      |                        ^~~
Language: C++

#include <iostream>
using namespace std;
static const int MAX = 100;
static const int INFTY = (1 << 21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n, M[MAX][MAX];

int prim() {
	int u, minv;
	int d[MAX], p[MAX], color[MAX];
	for (int i = 0; i < n; i++)
	{
		d[i] = INFTY;
		p[i] = -1;
		color[i] = WHITE;
	}
	d[0] = 0;
	while (1)
	{
		minv = INFTY;
		u = -1;
		minv = d[i];
		for (int i = 0; i < n; i++)
		{
			if (minv > d[i] && color[i] != BLACK) {
				u = i;
				minv = d[i];
			}
		}
		if (u == -1) break;
		color[u] = BLACK;
		for (int v = 0; v < n; v++)
		{
			if (d[v] > M[u][v]) {
				d[v] = M[u][v];
				p[v] = u;
				color[v] = GRAY;
			}
		}
		int sum = 0;
		for (int i = 0; i < n; i++)
		{
			if (p[i] != -1) sum += M[i][p[i]];
		}
	}
		return sum;
	}

	int main() {
		cin >> n;

		for (int i = 0; i < n; i++)
		{
			for (int j = 0; j < n; j++) {
				int e; cin >> e;
				M[i][j] = (e == -1) ? INFTY : e;
			}
		}
		cout << prim() << endl;
		return 0;
	}

Compiler output:
a.cc: In function 'int prim()':
a.cc:25:26: error: 'i' was not declared in this scope
   25 |                 minv = d[i];
      |                          ^
a.cc:49:24: error: 'sum' was not declared in this scope
   49 |                 return sum;
      |                        ^~~
Language: C++

#include <iostream>
using namespace std;
static const int MAX = 100;
static const int INFTY = (1 << 21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n, M[MAX][MAX];

int prim() {
	int u, minv;
	int d[MAX], p[MAX], color[MAX];
	for (int i = 0; i < n; i++)
	{
		d[i] = INFTY;
		p[i] = -1;
		color[i] = WHITE;
	}
	d[0] = 0;
	while (1)
	{
		minv = INFTY;
		u = -1;
		for (int i = 0; i < n; i++)
		{
			if (minv > d[i] && color[i] != BLACK) {
				u = i;
				minv = d[i];
			}
		}
		if (u == -1) break;
		color[u] = BLACK;
		for (int v = 0; v < n; v++)
		{
			if (d[v] > M[u][v]) {
				d[v] = M[u][v];
				p[v] = u;
				color[v] = GRAY;
			}
		}
		int sum = 0;
		for (int i = 0; i < n; i++)
		{
			if (p[i] != -1) sum += M[i][p[i]];
		}
	}
		return sum;
	}

	int main() {
		cin >> n;

		for (int i = 0; i < n; i++)
		{
			for (int j = 0; j < n; j++) {
				int e; cin >> e;
				M[i][j] = (e == -1) ? INFTY : e;
			}
		}
		cout << prim() << endl;
		return 0;
	}

Compiler output:
a.cc: In function 'int prim()':
a.cc:48:24: error: 'sum' was not declared in this scope
   48 |                 return sum;
      |                        ^~~
Language: C++

#include <stdio.h>

#define MAX 101
#define INF 100000

int main(){
  int i,j,n,min,k=1,minNode,sum=0;
  int a[MAX][MAX],x{[MAX],g[MAX];

  scanf("%d",&n);
  for(i=0 ; i<n ; i++){
    for(j=0 ; j<n ; j++){
      scanf("%d",&a[i][j]);
    }
  }


  x[0] = 0;
  g[0] = 1;
  for(i=1 ; i<n ; i++){
    g[i] = 0;
  }
  
  while(1){
    min = INF;
    
    for(i=0 ; i<k ; i++){
      for(j=0 ; j<n ; j++){
	if(min > a[x[i]][j] && a[x[i]][j]!= -1 && g[j] != 1){
	  min = a[x[i]][j];
	  minNode = j;
	}
      }
    }

    if(k!=n){
      x[k] = minNode;
      g[minNode] = 1;
      k++;
      sum += min;
    }
    else{ 
      break; 
    }
    
  }

  printf("%d\n",sum);
  
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:3:13: error: expected identifier before numeric constant
    3 | #define MAX 101
      |             ^~~
a.cc:8:22: note: in expansion of macro 'MAX'
    8 |   int a[MAX][MAX],x{[MAX],g[MAX];
      |                      ^~~
a.cc: In lambda function:
a.cc:8:26: error: expected '{' before ',' token
    8 |   int a[MAX][MAX],x{[MAX],g[MAX];
      |                          ^
a.cc: In function 'int main()':
a.cc:8:27: error: 'g' was not declared in this scope
    8 |   int a[MAX][MAX],x{[MAX],g[MAX];
      |                           ^
a.cc:8:33: error: expected '}' before ';' token
    8 |   int a[MAX][MAX],x{[MAX],g[MAX];
      |                    ~            ^
a.cc:8:19: error: scalar object 'x' requires one element in initializer
    8 |   int a[MAX][MAX],x{[MAX],g[MAX];
      |                   ^
Language: C++

#include<iostream>
using namespace std;
static const int MAX=100;
static const int INFTY=(1<<21);
static const int WHITE=0;
static const int GRAY=1;
static const int BLACK=2;

int n,M[MAX][MAX];

int prim(){
int u,min;
int d[MAX],p[MAX],color[MAX];

for(int i=0;i<n;i++){
d[i]=INFTY;
p[i]=-1;
color[i]=WHITE;
}

d[0]=0;

while(1){
min=INFTY;
u=-1;
for(int i=0;i<n;i++){
if(min>d[i]&&color[i]!=BLACK){
u=i;
min=d[i];
}
}
if(u==-1)break;
color[u]=BLACK;
for(int v=0;v<n;v++){
if(color[v]!=BLACK&&M[u][v]!=INFTY;){
if(d[v]>M[u][v]){
d[v]=M[u][v];
p[v]=u;
color[v]=GRAY;
}
}
}
}
int sum=0;
for(int i=0;i<n;i++){
if(p[i]!=-1)sum+=M[i][p[i]];
}
return sum;
}

int main(){
cin >> n;

for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
int e;
cin >> e;
M[i][j]=(e==-1)?INFTY : e;
}
}

cout << prim() << endl;

return 0;
}

Compiler output:
a.cc: In function 'int prim()':
a.cc:35:36: error: expected primary-expression before ')' token
   35 | if(color[v]!=BLACK&&M[u][v]!=INFTY;){
      |                                    ^
Language: C++

import array
import collections
import heapq

INF = 1e9

N = int(input())

AdjacentVertex = collections.namedtuple('AdjacentVertex', 'vertex cost')
adjacency_list = collections.defaultdict(set)

NO_VERTEX = -1
 
def compute_mst_prim(max_v, adj_list):
    pred = collections.defaultdict(lambda: NO_VERTEX)
    key = collections.defaultdict(lambda: INF)
    key[0] = 0
    pq = [(key[v], v) for v in range(max_v)]
    heapq.heapify(pq)
    in_pq = array.array("B", (True for _ in range(max_v)))
    while pq:
        _, u = heapq.heappop(pq)
        in_pq[u] = False
        for v, v_cost in adj_list[u]:
            if in_pq[v]:
                weight = v_cost
                if weight < key[v]:
                    pred[v] = u
                    key[v] = weight
                    heapq.heappush(pq, (weight, v))
                    in_pq[v] = True
    return (pred, key)

for i in range(N):
    u = list(map(int, input().split()))
    for j in range(N):
        if u[j] == -1:
            adjacency_list[i].add(AdjacentVertex(j, INF))
            adjacency_list[j].add(AdjacentVertex(i, INF))
        else:
            adjacency_list[i].add(AdjacentVertex(j, u[j]))
            adjacency_list[j].add(AdjacentVertex(i, u[j]))

(_, key) = compute_mst_prim(N, adjacency_list)

print(sum(key.values()))

Compiler output:
a.cc:9:41: warning: multi-character literal with 14 characters exceeds 'int' size of 4 bytes
    9 | AdjacentVertex = collections.namedtuple('AdjacentVertex', 'vertex cost')
      |                                         ^~~~~~~~~~~~~~~~
a.cc:9:59: warning: multi-character literal with 11 characters exceeds 'int' size of 4 bytes
    9 | AdjacentVertex = collections.namedtuple('AdjacentVertex', 'vertex cost')
      |                                                           ^~~~~~~~~~~~~
a.cc:1:1: error: 'import' does not name a type
    1 | import array
      | ^~~~~~
a.cc:1:1: note: C++20 'import' only available with '-fmodules-ts'
Language: C++

#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;

static const int MAX = 10000;
static const int INFTY = (1<<21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n;
vector<pair<int,int> > adj[MAX][MAX];

void dijkstra(){
    priority_queue<pair<int,int> > PQ;
    int color[MAX];
    int d[MAX];
    for(int i=0; i<n; i++){
        d[i] = INFTY;
        color[i] = WHITE;
    }
    
    d[0] = 0;
    PQ.push(make_pair(0,0));
    color[0] = GRAY;
    
    while(!PQ.empty()){
        pair<int,int> f = PQ.top(); PQ.pop();
        int u = f.second;
        color[u] = BLACK;
        
        if(d[u] < f.first*(-1)) continue;
        
        for(int j=0; j<adj[u].size(); j++){
            int v = adj[u][j].first;
            if(color[v]==BLACK) continue;
            if(d[v]>d[u]+adj[u][j].second){
                d[v] = d[u]+adj[u][j].second;
                PQ.push(make_pair(d[v]*(-1),v));
                color[v] = GRAY;
            }
        }
    }
    
    for(int i=0; i<n; i++){
        cout << i << " " << (d[i]==INFTY ? -1 : d[i]) << endl;
    }
}

int main(){
    int k,u,v,c;
    
    cin >> n;
    for(int i=0; i<n; i++){
        cin >> u >> k;
        for(int j=0; j<k; j++){
            cin >> v >> c;
            adj[u].push_back(make_pair(v,c));
        }
    }
    
    dijkstra();
    
    return 0;
}

Compiler output:
a.cc: In function 'void dijkstra()':
a.cc:35:31: error: request for member 'size' in 'adj[u]', which is of non-class type 'std::vector<std::pair<int, int> > [10000]'
   35 |         for(int j=0; j<adj[u].size(); j++){
      |                               ^~~~
a.cc:36:31: error: 'class std::vector<std::pair<int, int> >' has no member named 'first'
   36 |             int v = adj[u][j].first;
      |                               ^~~~~
a.cc:38:36: error: 'class std::vector<std::pair<int, int> >' has no member named 'second'
   38 |             if(d[v]>d[u]+adj[u][j].second){
      |                                    ^~~~~~
a.cc:39:39: error: 'class std::vector<std::pair<int, int> >' has no member named 'second'
   39 |                 d[v] = d[u]+adj[u][j].second;
      |                                       ^~~~~~
a.cc: In function 'int main()':
a.cc:59:20: error: request for member 'push_back' in 'adj[u]', which is of non-class type 'std::vector<std::pair<int, int> > [10000]'
   59 |             adj[u].push_back(make_pair(v,c));
      |                    ^~~~~~~~~
Language: C++

#include <iostream>
#include <utility>
#include <string>

using namespace std;


int P[10010]; // 0 ?????? 10000 ?????§????????????????????±?????????
void init(int N) { // ????????? ??????????????¨???????????????????????????
  for (int i=0; i<=N; ++i) P[i] = i;
  // ??¨: ????????? [0,N-1] ????????? [1,N] ?????????????????????
  // ???????????§???????????§???????????????????????§??? [0,N] ???????????¨??????
}
int root(int a) { // a ??? root(??£??¨???) ????±???????
  if (P[a] == a) return a; // a ??? root
  return (P[a] = root(P[a])); // a ????????? root ????±???????a ????????¨??????
}
bool is_same_set(int a, int b) { // a ??¨ b ???????????°?????????????±???????????
  return root(a) == root(b);
}
void unite(int a, int b) { // a ??¨ b ???????????°?????????????????¨??????
  P[root(a)] = root(b);
}


int N=0;
int A[100+10][100+10] = {0};

int cost[10100] = {0};
int src[10100] = {0};
int dst[10100] = {0};

pair<int,int> c_n[10100];



int main() {
  cin >> N;
  init(N+10);
  
  int k=0;
  for(int j=0;j<N;++j){
    for(int i=0;i<N;++i){
      cin >> A[i][j];
      //cout << A[i][j] << "|";
      if (A[i][j] != -1){
	cost[k] = A[i][j];
	src[k] = i;
	dst[k] = j;
	c_n[k] = make_pair(cost[k],k);
	++k;
      }
    }
    //cout << endl;
  }

  
  /*
  for (int i=0;i<20;++i){
    cout << c_n[i].first << " " << c_n[i].second << endl;
  }

  cout << endl << "SORT" << endl;

  
  for (int i=0;i<20;++i){
    cout << c_n[i].first << " " << c_n[i].second << endl;
  }*/

  sort(c_n, c_n+k);
  /*
  c_n[0].second
  ???????????????
  is_same_set
  ??????
  unite(src[],dst[])
?????????
  c_n[1].second????????????k???????????§????????°??????
  */

  int num = 0;
  int sum = 0;
  for(int i=0;i<k;++i){
    num = c_n[i].second;
    if(is_same_set(src[num], dst[num]) == 0){
      unite(src[num], dst[num]);
      sum += cost[num];
      //cout << num << " " << sum << endl;
    }
  }
  cout << sum << endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:70:3: error: 'sort' was not declared in this scope; did you mean 'short'?
   70 |   sort(c_n, c_n+k);
      |   ^~~~
      |   short
Language: C++

#include<iostream>

using namespace std;
static const int MAX = 100;
static const int INFTY = (1<<21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n, M[MAX][MAX];

int prim() {
   int a, min;
   int d[MAX], p[MAX], color[MAX];
 
   for ( int i = 0; i < n; i++) {
      d[i] = INFTY;
      p[i] = -1;
      color[i] = WHITE;
   }

   d[0] = 0;

   while ( 1 ) {
      min = INFTY;
      u = -1;

      for ( int i = 0; i < n; i++ ) {
         if ( min > d[i] && color[i] != BLACK ) {
            a = i;
            min = d[i];
         }
      }

      if ( a == -1 ) break;
      color[a] = BLACK;
      for ( int v = 0; v < n; v++ ) {
         if ( color[v] != BLACK && M[a][v] != INFTY ) {
            if ( d[v] > M[a][v] ) {
               d[v] = M[a][v];
               color[v] = GRAY;
            }
         }
      }
   }

   int sum = 0;
   for ( int i = 0; i < n; i++ ) {
      if ( p[i] != -1 ) sum = sum + M[i][p[i]];
   }
 
   return sum;
}

int main() {
   cin >> n;

   for ( int i = 0; i < n; i++ ) {
      for ( int j = 0; j < n; j++ ) { 
         int e; cin >> e;
         M[i][j] = (e == -1) ? INFTY : e;
      }
   }

   cout << prim() << endl;

   return 0;
}

Compiler output:
a.cc: In function 'int prim()':
a.cc:26:7: error: 'u' was not declared in this scope
   26 |       u = -1;
      |       ^
Language: C++

#include<iostream>
  
using namespace std;
static const int MAX = 100;
static const int INFTY = (1<<21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;
  
int n, M[MAX][MAX];
  
int prim() {
   int a, min;
   int d[MAX], p[MAX], color[MAX];
   
   for ( int i = 0; i < n; i++) {
      d[i] = INFTY;
      p[i] = -1;
      color[i] = WHITE;
   }
  
   d[0] = 0;
  
   while ( 1 ) {
      min = INFTY;
      a = -1;
  
      for ( int i = 0; i < n; i++ ) {
         if ( min > d[i] && color[i] != BLACK ) {
            a = i;
            min = d[i];
         }
      }
  
      if ( a == -1 ) break;
      color[a] = BLACK;
      for ( int v = 0; v < n; v++ ) {
         if ( color[v] != BLACK && M[a][v] != INFTY ) {
            if ( d[v] > M[a][v] ) {
               d[v] = M[a][v];
               p[v] = u;
               color[v] = GRAY;
            }
         }
      }
   }
  
   int sum = 0;
   for ( int i = 0; i < n; i++ ) {
      if ( p[i] != -1 ) sum = sum + M[i][p[i]];
   }
   
   return sum;
}
  
int main() {
   cin >> n;
  
   for ( int i = 0; i < n; i++ ) {
      for ( int j = 0; j < n; j++ ) { 
         int e; cin >> e;
         M[i][j] = (e == -1) ? INFTY : e;
      }
   }
  
   cout << prim() << endl;
  
   return 0;
}

Compiler output:
a.cc: In function 'int prim()':
a.cc:41:23: error: 'u' was not declared in this scope
   41 |                p[v] = u;
      |                       ^
Language: C++

#include<iostream>

using namespace std;

int n, M[100][100], W = 0, G = 1, B = 2;

int prim () {

    int u, minv, i, v, d[100], p[100], color[100], sum;

    for (i = 0; i < n; i++) {
        d[i] = (1 << 21);
        p[i] = -1;
        color[i] = W;
    }

    d[0] = 0;

    while (1) {

        minv = (1 << 21);
        u = -1;
        for (i = 0; i < n; i++) {
            if (minv > d[i] && color[i] != B) {
                u = i;
                minv = d[i];
            }
        }
        if (u == -1) {
            break;
        }
        color[u] = B;
        for (v = 0; v < n; v++) {
            if (color[v] != B && M[u][v] != (1 << 21)) {
                if (d[v] > M[u][v]) {
                    d[v] = M[u][v];
                    p[v] = u;
                    color[v] = G;
                }
            }
        }

    }

    sum = 0;
    for (i = 0; i < n; i++) {
        if (p[i] != -1) {
            sum += M[i][p[i]];
    }

    return sum;

}

int main () {

    int i, j, e;

    cin >> n;

    for (i = 0; i < n; i++) {
        for (j = 0; j < n; j++) {
            cin >> e;
            M[i][j] = (e == -1) ? (1 << 21) : e;
        }
    }

    cout << prim () << endl;

    return 0;

}

Compiler output:
a.cc: In function 'int prim()':
a.cc:55:10: warning: empty parentheses were disambiguated as a function declaration [-Wvexing-parse]
   55 | int main () {
      |          ^~
a.cc:55:10: note: remove parentheses to default-initialize a variable
   55 | int main () {
      |          ^~
      |          --
a.cc:55:10: note: or replace parentheses with braces to value-initialize a variable
a.cc:55:13: error: a function-definition is not allowed here before '{' token
   55 | int main () {
      |             ^
a.cc:72:2: error: expected '}' at end of input
   72 | }
      |  ^
a.cc:7:13: note: to match this '{'
    7 | int prim () {
      |             ^
a.cc:72:2: warning: control reaches end of non-void function [-Wreturn-type]
   72 | }
      |  ^
Language: C++

#include "stdafx.h"
#include <iostream>
using namespace std;

int main(void)
{
	int n, now = 0, flag[101] = {};
	long ans = 0, an[100][100], min[100];

	cin >> n;

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++)
			cin >> an[i][j];
		min[i] = 1000000000;
	}

	do {
		long key = LONG_MAX, key_i;
		flag[now] = 1;
		flag[100] = 0;

		for (int i = 0; i < n; i++) {
			if (an[now][i] != -1 && an[now][i] < min[i] && flag[i] == 0)
				min[i] = an[now][i];
			if (flag[i] == 0 && min[i] < key) {
				key = min[i];
				key_i = i;
			}
			if (flag[i] == 1)
				flag[100]++;
		}

		now = key_i;
		ans += key;

	} while (flag[100] != n - 1);

	cout << ans << endl;

	return 0;
}

Compiler output:
a.cc:1:10: fatal error: stdafx.h: No such file or directory
    1 | #include "stdafx.h"
      |          ^~~~~~~~~~
compilation terminated.
Language: C++


#include <iostream>
using namespace std;

int main(void)
{
	int n, now = 0, flag[101] = {};
	long ans = 0, an[100][100], min[100];

	cin >> n;

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++)
			cin >> an[i][j];
		min[i] = 1000000000;
	}

	do {
		long key = LONG_MAX, key_i;
		flag[now] = 1;
		flag[100] = 0;

		for (int i = 0; i < n; i++) {
			if (an[now][i] != -1 && an[now][i] < min[i] && flag[i] == 0)
				min[i] = an[now][i];
			if (flag[i] == 0 && min[i] < key) {
				key = min[i];
				key_i = i;
			}
			if (flag[i] == 1)
				flag[100]++;
		}

		now = key_i;
		ans += key;

	} while (flag[100] != n - 1);

	cout << ans << endl;

	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:19:28: error: 'LONG_MAX' was not declared in this scope
   19 |                 long key = LONG_MAX, key_i;
      |                            ^~~~~~~~
a.cc:3:1: note: 'LONG_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
    2 | #include <iostream>
  +++ |+#include <climits>
    3 | using namespace std;
a.cc:28:33: error: 'key_i' was not declared in this scope; did you mean 'key_t'?
   28 |                                 key_i = i;
      |                                 ^~~~~
      |                                 key_t
a.cc:34:23: error: 'key_i' was not declared in this scope; did you mean 'key_t'?
   34 |                 now = key_i;
      |                       ^~~~~
      |                       key_t
Language: C++

#include "stdafx.h"
#include <iostream>

#define MAX 100000000;
using namespace std;

int main(void)
{
	int n, now = 0, flag[101] = {};
	long ans = 0, an[100][100], min[100];

	cin >> n;

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++)
			cin >> an[i][j];
		min[i] = MAX;
	}

	do {
		long key = , key_i;
		flag[now] = 1;
		flag[100] = 0;

		for (int i = 0; i < n; i++) {
			if (an[now][i] != -1 && an[now][i] < min[i] && flag[i] == 0)
				min[i] = an[now][i];
			if (flag[i] == 0 && min[i] < key) {
				key = min[i];
				key_i = i;
			}
			if (flag[i] == 1)
				flag[100]++;
		}

		now = key_i;
		ans += key;

	} while (flag[100] != n - 1);

	cout << ans << endl;

	return 0;
}

Compiler output:
a.cc:1:10: fatal error: stdafx.h: No such file or directory
    1 | #include "stdafx.h"
      |          ^~~~~~~~~~
compilation terminated.
Language: C++

#include <iostream>
#define MAX 1000000000;
using namespace std;

int main(void)
{
	int n, now = 0, flag[101] = {};
	long ans = 0, an[100][100], min[100];

	cin >> n;

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++)
			cin >> an[i][j];
		min[i] = MAX;
	}

	do {
		long key = MAX, key_i;
		flag[now] = 1;
		flag[100] = 0;

		for (int i = 0; i < n; i++) {
			if (an[now][i] != -1 && an[now][i] < min[i] && flag[i] == 0)
				min[i] = an[now][i];
			if (flag[i] == 0 && min[i] < key) {
				key = min[i];
				key_i = i;
			}
			if (flag[i] == 1)
				flag[100]++;
		}

		now = key_i;
		ans += key;

	} while (flag[100] != n - 1);

	cout << ans << endl;

	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:19:31: error: expected primary-expression before ',' token
   19 |                 long key = MAX, key_i;
      |                               ^
a.cc:19:33: error: 'key_i' was not declared in this scope; did you mean 'key_t'?
   19 |                 long key = MAX, key_i;
      |                                 ^~~~~
      |                                 key_t
Language: C++

#include<iostream>
using namespace std;
static const int MAX = 100;
static const int INFTY = (1<<21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n, G[MAX][MAX];

int prim() {
  int u, minv;
  int d[MAX], p[MAX], color[MAX];

  for ( int i = 0; i < n; i++ ) {
    d[i] = INFTY;
    p[i] = -1;
    color[i] = WHITE;
  }

  d[0] = 0;

  while ( 1 ) {
    minv = INFTY;
    u = -1;
    for ( int i = 0; i < n; i++ ) {
      if ( minv > d[i] && color[i] != BLACK ) {
        u = i;
        minv = d[i];
      }
    }
    if ( u == -1 ) break;
    color[u] = BLACK;
    for ( int v = 0; v < n; v++ ) {
      if ( color[v] != BLACK && M[u][v] != INFTY ) {
        if( d[v] > M[u][v] ) {
          d[v] = M[u][v];
          p[v] = u;
          color[v] = GRAY;
        }
      }
    }
  }
  int sum = 0;
  for ( int i = 0; i < n; i++ ) {
    if ( p[i] != -1 ) sum += M[i][p[i]];
  }

  return sum;
}

int main() {
  cin >> n;

  for ( int i = 0; i < n; i++ ) {
    for ( int j = 0; j < n; j++ ) {
      int e; cin >> e;
      M[i][j] = (e == -1) ? INFTY : e;
    }
  }

  cout << prim() << endl;

  return 0;
}

Compiler output:
a.cc: In function 'int prim()':
a.cc:35:33: error: 'M' was not declared in this scope
   35 |       if ( color[v] != BLACK && M[u][v] != INFTY ) {
      |                                 ^
a.cc:46:30: error: 'M' was not declared in this scope
   46 |     if ( p[i] != -1 ) sum += M[i][p[i]];
      |                              ^
a.cc: In function 'int main()':
a.cc:58:7: error: 'M' was not declared in this scope
   58 |       M[i][j] = (e == -1) ? INFTY : e;
      |       ^
Language: C++

#include<iostream>
using namespace std;
static const int MAX = 100;
static const int INFTY = (1 <<21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n, M[MAX][MAX];

int prim() {
  int prim() {
   int u,minv;
   int d[MAX], p[MAX],color[MAX];

   for(int i = 0; i < n; i++){
    d[i] = INFTY;
    p[i] = -1;
   color[i] = WHITE;
  }

  d[0] = 0;

  while( 1 ){
   minv = INFTY;
   u = i;
   minv = d[i];
   }
 }
 if( u == -1) break;
 color[u] = BLACK;
 for(int v = 0; v < n; v++){
  if(color[v] != BLACK && M[u][v] != INFTY){
    if(d[v] > M[u][v]){
       d[v] = M[u][v];
       p[v] = u;
    color[v] = GRAY;
   }
  }
 }
}
 int sum = 0;
 for(int i = 0; i < n; i++){
   if(p[i] != -1) sum += M[i][p[i]];
   }

   return sum;
}
   
int main(){
  cin >> n;

  for(int i = 0; i < n; i++){
   for(int j = 0; j < n; j++){
     int e; cin >> e;
     M[i][j] = (e == -1) ? INFTY ; e;
   }
  }

  cout << prim() << endl;

  return 0;
}

Compiler output:
a.cc: In function 'int prim()':
a.cc:12:11: warning: empty parentheses were disambiguated as a function declaration [-Wvexing-parse]
   12 |   int prim() {
      |           ^~
a.cc:12:11: note: remove parentheses to default-initialize a variable
   12 |   int prim() {
      |           ^~
      |           --
a.cc:12:11: note: or replace parentheses with braces to value-initialize a variable
a.cc:12:14: error: a function-definition is not allowed here before '{' token
   12 |   int prim() {
      |              ^
a.cc:30:6: error: 'u' was not declared in this scope
   30 |  if( u == -1) break;
      |      ^
a.cc:30:15: error: break statement not within loop or switch
   30 |  if( u == -1) break;
      |               ^~~~~
a.cc:31:2: error: 'color' was not declared in this scope; did you mean 'tolower'?
   31 |  color[u] = BLACK;
      |  ^~~~~
      |  tolower
a.cc:31:8: error: 'u' was not declared in this scope
   31 |  color[u] = BLACK;
      |        ^
a.cc:34:8: error: 'd' was not declared in this scope
   34 |     if(d[v] > M[u][v]){
      |        ^
a.cc:36:8: error: 'p' was not declared in this scope
   36 |        p[v] = u;
      |        ^
a.cc:41:1: warning: no return statement in function returning non-void [-Wreturn-type]
   41 | }
      | ^
a.cc: At global scope:
a.cc:43:2: error: expected unqualified-id before 'for'
   43 |  for(int i = 0; i < n; i++){
      |  ^~~
a.cc:43:17: error: 'i' does not name a type
   43 |  for(int i = 0; i < n; i++){
      |                 ^
a.cc:43:24: error: 'i' does not name a type
   43 |  for(int i = 0; i < n; i++){
      |                        ^
a.cc:47:4: error: expected unqualified-id before 'return'
   47 |    return sum;
      |    ^~~~~~
a.cc:48:1: error: expected declaration before '}' token
   48 | }
      | ^
a.cc: In function 'int main()':
a.cc:56:33: error: expected ':' before ';' token
   56 |      M[i][j] = (e == -1) ? INFTY ; e;
      |                                 ^~
      |                                 :
a.cc:56:34: error: expected primary-expression before ';' token
   56 |      M[i][j] = (e == -1) ? INFTY ; e;
      |                                  ^
Language: C++

#include<iostream>
using namespace std;
static const int MAX = 100;
static const int INFTY = (1 <<21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n, M[MAX][MAX];

int prim() {
   int u,minv;
   int d[MAX], p[MAX],color[MAX];

   for(int i = 0; i < n; i++){
    d[i] = INFTY;
    p[i] = -1;
   color[i] = WHITE;
  }

  d[0] = 0;

  while( 1 ){
   minv = INFTY;
   u = i;
   minv = d[i];
   }
 }
 if( u == -1) break;
 color[u] = BLACK;
 for(int v = 0; v < n; v++){
  if(color[v] != BLACK && M[u][v] != INFTY){
    if(d[v] > M[u][v]){
       d[v] = M[u][v];
       p[v] = u;
    color[v] = GRAY;
   }
  }
 }
}
 int sum = 0;
 for(int i = 0; i < n; i++){
   if(p[i] != -1) sum += M[i][p[i]];
   }

   return sum;
}
   
int main(){
  cin >> n;

  for(int i = 0; i < n; i++){
   for(int j = 0; j < n; j++){
     int e; cin >> e;
     M[i][j] = (e == -1) ? INFTY ; e;
   }
  }

  cout << prim() << endl;

  return 0;
}

Compiler output:
a.cc: In function 'int prim()':
a.cc:25:8: error: 'i' was not declared in this scope
   25 |    u = i;
      |        ^
a.cc: At global scope:
a.cc:29:2: error: expected unqualified-id before 'if'
   29 |  if( u == -1) break;
      |  ^~
a.cc:30:2: error: 'color' does not name a type
   30 |  color[u] = BLACK;
      |  ^~~~~
a.cc:31:2: error: expected unqualified-id before 'for'
   31 |  for(int v = 0; v < n; v++){
      |  ^~~
a.cc:31:17: error: 'v' does not name a type
   31 |  for(int v = 0; v < n; v++){
      |                 ^
a.cc:31:24: error: 'v' does not name a type
   31 |  for(int v = 0; v < n; v++){
      |                        ^
a.cc:40:1: error: expected declaration before '}' token
   40 | }
      | ^
a.cc:42:2: error: expected unqualified-id before 'for'
   42 |  for(int i = 0; i < n; i++){
      |  ^~~
a.cc:42:17: error: 'i' does not name a type
   42 |  for(int i = 0; i < n; i++){
      |                 ^
a.cc:42:24: error: 'i' does not name a type
   42 |  for(int i = 0; i < n; i++){
      |                        ^
a.cc:46:4: error: expected unqualified-id before 'return'
   46 |    return sum;
      |    ^~~~~~
a.cc:47:1: error: expected declaration before '}' token
   47 | }
      | ^
a.cc: In function 'int main()':
a.cc:55:33: error: expected ':' before ';' token
   55 |      M[i][j] = (e == -1) ? INFTY ; e;
      |                                 ^~
      |                                 :
a.cc:55:34: error: expected primary-expression before ';' token
   55 |      M[i][j] = (e == -1) ? INFTY ; e;
      |                                  ^
Language: C++

#include<iostream>
using namespace std;
static const int MAX = 100;
static const int INFTY = (1 <<21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n, M[MAX][MAX];

int prim() {
   int u,minv;
   int d[MAX], p[MAX],color[MAX];

   for(int i = 0; i < n; i++){
    d[i] = INFTY;
    p[i] = -1;
    color[i] = WHITE;
  }

  d[0] = 0;

  while( 1 ){
   minv = INFTY;
   u = -1;
   for(int i = 0; i < n;i++){
   if(minv > d[i] && color[i] != BLACK){
   u = i;
   minv = d[i];
   }
 }
 if( u == -1) break;
 color[u] = BLACK;
 for(int v = 0; v < n; v++){
  if(color[v] != BLACK && M[u][v] != INFTY){
    if(d[v] > M[u][v]){
       d[v] = M[u][v];
       p[v] = u;
    color[v] = GRAY;
   }
  }
 }
}
 int sum = 0;
 for(int i = 0; i < n; i++){
   if(p[i] != -1) sum += M[i][p[i]];
   }

   return sum;
}
   
int main(){
  cin >> n;

  for(int i = 0; i < n; i++){
   for(int j = 0; j < n; j++){
     int e; cin >> e;
     M[i][j] = (e == -1) ? INFTY ; e;
   }
  }

  cout << prim() << endl;

  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:58:33: error: expected ':' before ';' token
   58 |      M[i][j] = (e == -1) ? INFTY ; e;
      |                                 ^~
      |                                 :
a.cc:58:34: error: expected primary-expression before ';' token
   58 |      M[i][j] = (e == -1) ? INFTY ; e;
      |                                  ^
Language: C++

#include <iostream>
#include <vector>
#include <numeric>

using namespace std;

const int N = 100;

/*
// ????????????
Vnew = {x}???????????§ x ??? V ????????§??????????????????????????????????????????
Enew = {}
while (Vnew ??? V)
    Vnew ????????????????????? u ??¨ ????????????????????? v ????????¶?????????????°??????? (u, v) ??? E ????????????
    v ??? Vnew ????????????
    (u, v) ??? Enew ????????????
*/

enum Color : int {
    WHITE,
    GRAY,
    BLACK,
};

int main() {
    int A[N][N];

    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            int a;
            cin >> a;
            A[i][j] = a == -1 ? a : numeric_limits<int>::max();
        }
    }

    vector<int> color(n, WHITE);
    vector<int> d(n, numeric_limits<int>::max());
    vector<int> p(n, -1);

    d[0] = 0;
    while (1) {
        int minv = numeric_limits<int>::min();
        int u = -1;
        for (int i = 0; i < n; ++i) {
            if (minv > d[i] && color[i] != BLACK) {
                u = i;
                minv = d[i];
            }
        }
        if (u == -1)
            break;
        color[u] = BLACK;
        for (int v = 0; v < n; ++v) {
            if (color[v] != BLACK && A[u][v] != numeric_limits<int>::max()) {
                if (d[v] > A[u][v]) {
                    d[v] = A[u][v];
                    p[v] = u;
                    color[v] = GRAY;
                }
            }
        }
    }
    int sum;
    for (int i =0; i < n; ++i) {
        if (p[i] != -1)
            sum += A[i][p[i]];
    }
    cout << sum << endl;

    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:34:37: error: 'numeric_limits' was not declared in this scope
   34 |             A[i][j] = a == -1 ? a : numeric_limits<int>::max();
      |                                     ^~~~~~~~~~~~~~
a.cc:34:52: error: expected primary-expression before 'int'
   34 |             A[i][j] = a == -1 ? a : numeric_limits<int>::max();
      |                                                    ^~~
a.cc:39:22: error: 'numeric_limits' was not declared in this scope
   39 |     vector<int> d(n, numeric_limits<int>::max());
      |                      ^~~~~~~~~~~~~~
a.cc:39:37: error: expected primary-expression before 'int'
   39 |     vector<int> d(n, numeric_limits<int>::max());
      |                                     ^~~
a.cc:44:35: error: expected primary-expression before 'int'
   44 |         int minv = numeric_limits<int>::min();
      |                                   ^~~
a.cc:56:64: error: expected primary-expression before 'int'
   56 |             if (color[v] != BLACK && A[u][v] != numeric_limits<int>::max()) {
      |                                                                ^~~
a.cc:56:64: error: expected ')' before 'int'
   56 |             if (color[v] != BLACK && A[u][v] != numeric_limits<int>::max()) {
      |                ~                                               ^~~
      |                                                                )
Language: C++

#include <iostream>
#include <vector>
#include <numeric>

using namespace std;

const int N = 100;



enum {
    WHITE,
    GRAY,
    BLACK,
};

int main() {
    int A[N][N];

    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            int a;
            cin >> a;
            A[i][j] = a == -1 ? a : numeric_limits<int>::max();
        }
    }

    // ????????????
    vector<int> color(n, WHITE); // ??????????¨??????¶???
    vector<int> d(n, numeric_limits<int>::max());
    vector<int> p(n, -1);

    d[0] = 0;
    while (1) {
        int minv = numeric_limits<int>::min();
        int u = -1;
        for (int i = 0; i < n; ++i) {
            if (minv > d[i] && color[i] != BLACK) {
                u = i;
                minv = d[i];
            }
        }
        if (u == -1)
            break;
        color[u] = BLACK;
        for (int v = 0; v < n; ++v) {
            if (color[v] != BLACK && A[u][v] != numeric_limits<int>::max()) {
                if (d[v] > A[u][v]) {
                    d[v] = A[u][v];
                    p[v] = u;
                    color[v] = GRAY;
                }
            }
        }
    }
    int sum;
    for (int i =0; i < n; ++i) {
        if (p[i] != -1)
            sum += A[i][p[i]];
    }
    cout << sum << endl;

    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:26:37: error: 'numeric_limits' was not declared in this scope
   26 |             A[i][j] = a == -1 ? a : numeric_limits<int>::max();
      |                                     ^~~~~~~~~~~~~~
a.cc:26:52: error: expected primary-expression before 'int'
   26 |             A[i][j] = a == -1 ? a : numeric_limits<int>::max();
      |                                                    ^~~
a.cc:32:22: error: 'numeric_limits' was not declared in this scope
   32 |     vector<int> d(n, numeric_limits<int>::max());
      |                      ^~~~~~~~~~~~~~
a.cc:32:37: error: expected primary-expression before 'int'
   32 |     vector<int> d(n, numeric_limits<int>::max());
      |                                     ^~~
a.cc:37:35: error: expected primary-expression before 'int'
   37 |         int minv = numeric_limits<int>::min();
      |                                   ^~~
a.cc:49:64: error: expected primary-expression before 'int'
   49 |             if (color[v] != BLACK && A[u][v] != numeric_limits<int>::max()) {
      |                                                                ^~~
a.cc:49:64: error: expected ')' before 'int'
   49 |             if (color[v] != BLACK && A[u][v] != numeric_limits<int>::max()) {
      |                ~                                               ^~~
      |                                                                )