#include "stdafx.h"
#include <stdlib.h>
#include<stdio.h>



typedef struct student
{
	char imie[20];
	char nazwisko[30];
	int rok;
	char adres[40];
	char kod[10];
	double stypendium;
	struct student *p;
	struct student *n;


}STUDENT;

STUDENT* sortuj(STUDENT* B)
{
	if (B == NULL)
	{
		return B;
	}

	STUDENT* naj = B;
	STUDENT* tmp = B;
	while (tmp->n != NULL)
	{
		tmp = tmp->n;
		if (naj->stypendium > tmp->stypendium)
		{
			naj = tmp;
		}
	}

	tmp = naj->n;
	naj->n = B->n;
	B -> n = tmp;
	tmp = naj->p;
	naj->p = B->p;
	B->p = tmp;

	sortuj(naj->n);

	return naj;
}

FILE *fd;

int _tmain(int argc, _TCHAR* argv[])
{


	fd = fopen("dane.txt", "r");
	int n = 5;
	STUDENT *H, *T, **B, *P, *NAJ,*k;


	for (int i = 0; i < n; i++)
	{
		B =malloc(sizeof(STUDENT));
		fscanf(fd, "%s%s%d%s%s%lf", B[i]->imie, B[i]->nazwisko, &B[i]->rok, B[i]->adres, B[i]->kod, &B[i]->stypendium);

		if (i == 0)
		{
			B[i]->p = (STUDENT*)0;
			H = B[i];

		}


		if (i > 0)
		{
			B[i]->p = P;
			P->n = B[i];
		}

		if (i == n - 1)
		{
			B[i]->p = P;
			B[i]->n = (STUDENT*)0;
			T = B;
		}

		P = B;

		B[i] = malloc(sizeof(STUDENT));
		fscanf(fd, "%s%s%d%s%s%lf", B[i]->imie, B[i]->nazwisko, &B[i]->rok, B[i]->adres, B[i]->kod, &B[i]->stypendium);
		k=sortuj(B);
		printf("%s%s%d%s%s%lf", k->imie, k->nazwisko, k->rok, k->adres, k->kod, k->stypendium);
	}


	system("PAUSE");
	return 0;
}