1052. Linked List Sorting (25)

1052. Linked List Sorting (25)

#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
using namespace std;

struct cstruct
{
int address,key,next;
bool exsit;
cstruct(){exsit=false;}
bool operator < (const cstruct & st) const
{
return key<st.key;
}
};

class CA
{
public:
enum{N=1000000};
void run();
vector<cstruct> v,v1;
int n,firstaddress;
};
void CA::run()
{
cin>>n>>firstaddress;
cstruct st;
v1.resize(N);
while(n-->0)
{
cin>>st.address>>st.key>>st.next;
st.exsit=true;
v1[st.address]=st;
}
int addr=firstaddress;
while(addr!=-1)
{
if(!v1[addr].exsit) break;
v.push_back(v1[addr]);
addr=v1[addr].next;
}
sort(v.begin(),v.end());
if(v.size()>0)
{
cout<<setfill('0');
cout<<v.size()<<" "<<setw(5)<<v[0].address<<endl;
int i;
for(i=0;i<v.size()-1;i++)
{
cout<<setw(5)<<v[i].address<<" "<<v[i].key<<" "<<setw(5)<<v[i+1].address<<endl;
}
cout<<setw(5)<<v[i].address<<" "<<v[i].key<<" "<<-1<<endl;
}
else
{
cout<<0<<" "<<-1<<endl;
}
}

int main()
{

// freopen("test.in","r",stdin);
CA *a=new CA;
a->run();
return 0;
}