Cod sursa(job #2328089)
| Utilizator | Data | 25 ianuarie 2019 13:08:24 | |
|---|---|---|---|
| Problema | Arbore partial de cost minim | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
//Niga Narcis, cl a XIa H
#include <fstream>
#include <iostream>
using namespace std;
ifstream in("apm.in");
ofstream out("apm.out");
int n, m, mat[400000][3],i,j,tatal,v[200000],cm;
int main()
{
in>>n>>m;
for(i=0;i<m;i++)
{
for(j=0;j<3;j++)
in>>mat[i][j];
}
for(i=0;i<m;i++)
{
for(j=0;j<2;j++)
v[mat[i][j]]++;
}
for(i=0;i<m;i++)
{
if(tatal<v[i])
{
tatal=i;
}
}
for(i=0;i<m;i++)
{
if(mat[i][2]==cm)
{
}
}
return 0;
}
