Cod sursa(job #362964)
Utilizator | Data | 11 noiembrie 2009 13:47:05 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<iostream>
#include<algorithm>
#include<vector>
struct data{
int x;
int y;
int mark;
int init;
};
data pct[1000];
bool compare(data i,data j)
{return (i.x<j.x);
}
int main()
{vector<int> stiva;
cin>>n;
for(i=1;i<=n;i++)
{cin>>pct[i].x>>pct[i].y;
pct[i].init=i;
sort(pct+1,pct+n+1,compare)
pct[1].mark=1;
return 1;
}