【 PAT 】 1052. Linked List Sorting - map / qsort 용법

원제 링크 http://pat.zju.edu.cn/contests/pat-a-practise/1052
1052. Linked List Sorting (25)
시간 제한
400 ms
메모리 제한
32000 kB
코드 길이 제한
16000 B
문제 풀이 절차
Standard
A linked list consists of a series of structures, which are not necessarily adjacent in memory. We assume that each structure contains an integer key and a Next pointer to the next structure. Now given a linked list, you are supposed to sort the structures according to their key values in increasing order.
Input Specification:
Each input file contains one test case. For each case, the first line contains a positive N (< 105) and an address of the head node, where N is the total number of nodes in memory and the address of a node is a 5-digit positive integer. NULL is represented by -1.
Then N lines follow, each describes a node in the format:
Address Key Next
where Address is the address of the node in memory, Key is an integer in [-105, 105], and Next is the address of the next node. It is guaranteed that all the keys are distinct and there is no cycle in the linked list starting from the head node.
Output Specification:
For each test case, the output format is the same as that of the input, where N is the total number of nodes in the list and all the nodes must be sorted order.
Sample Input:

5 00001
11111 100 -1
00001 0 22222
33333 100000 11111
12345 -1 33333
22222 1000 12345

Sample Output:

5 12345
12345 -1 00001
00001 0 11111
11111 100 22222
22222 1000 33333
33333 100000 -1

제목:
제 시 된 노드 에서 사슬 하 나 를 찾아내다.그리고 키 를 작은 것 부터 큰 것 까지 정렬 해서 표시 합 니 다.
코드 는 다음 과 같 습 니 다:

#include <iostream>
#include <fstream>
#include <map>
#include <vector>
#include <iomanip>
using namespace std;

ifstream fin("in.txt");
//#define cin fin

struct Node
{
	int key;
	int next;
	Node(){}
	Node(int addr,int k){key = k;next = addr;}
};

int cmp(const void* A,const void* B)
{
	Node* aa = (Node*)A;
	Node* bb = (Node*)B;
	return aa->key - bb->key;
}

int main()
{
    int n;
	int head,addr;
	fin>>n>>head;
	map<int,Node> m;		//   Address key     
	vector<Node> v;
	Node* node = new Node[n];
	int i;
	for(i=0;i<n;i++)
	{
		fin>>addr>>node[i].key>>node[i].next;
		m[addr]=node[i];
	}
	int findKey = head;
	while(findKey != -1)			//         
	{
		map<int,Node>::const_iterator map_it = m.find(findKey);
		if(map_it != m.end())
		{
			Node newNode(findKey, map_it->second.key);
			v.push_back(newNode);
			findKey = map_it->second.next;
		}else
		{
			break;
		}
	}
	
	int size = v.size();
	if(size==0)
	{
		cout<<0<<' '<<-1<<endl;
		system( "PAUSE");
		return 0;
	}
	//sort(v.begin(),v.end());
	qsort(& *v.begin(),size,sizeof(Node),cmp);
	cout<<size<<" "<<setw(5)<<setfill('0')<<v.begin()->next<<endl;
	
	for(i=0;i<size;i++)
	{
		cout<<setw(5)<<setfill('0')<<v[i].next<<' '<<v[i].key<<' ';
		if(i != size-1)
		{
			cout<<setw(5)<<setfill('0')<<v[i+1].next<<endl;
		}else
		{
			cout<<-1<<endl;
		}
	}

    system( "PAUSE");
    return 0;
}