算法笔记之排序

#include <cstdio>

void selectSort(int *a,int n);
void insertSort(int *a,int n);
void bubbleSort(int *a,int n);
int main(){
	int a[5] = {1,5,3,6,2};
	bubbleSort(a,5);
	for(int i=0;i<5;i++){
		printf("%d\n",a[i]);
		
	}
	printf("hello world") ;
	return 0;
} 

//冒泡排序
void bubbleSort(int *a,int n){
	for(int i =1;i<n;i++){
		for(int j=0;j<n-i;j++){
			if(a[j]>a[j+1]){
				int temp = a[j+1];
				 a[j+1] = a[j];
				 a[j] = temp;
			}
		}
	}
} 

// 选择排序
void selectSort(int *a,int n){
	for(int i=0;i<n;i++){
		for(int j=i;j<n;j++){
			if(a[j]<a[i]){
				int temp = a[j];
				a[j] = a[i];
				a[i] = temp;
			}
		}
	}
} 

// 插入排序
void insertSort(int *a,int n){
	for(int i=1;i<n;i++){
		int j=i;
		int temp = a[i];
		while(j>1&&a[j]<a[j-1]){
			a[j] = a[j-1];
			j--;
		}
		a[j]= temp;
	}
}

#include <cstdio>
#include <cstring>
#include <algorithm> 

using namespace std;

struct Student{
	
	char id[15];
	int score;
	int location_number;
	int local_rank;
}stu[30010];

bool cmp(Student a ,Student b){
	if(a.score != b.score) return a.score>b.score;
	else return strcmp(a.id,b.id)<0;
}


int main(){
	int n,k,num=0;
	scanf("%d",&n);
	for(int i =1;i<=n;i++){
		scanf("%d",&k);
		for(int j = 0;j<k;j++){
			scanf("%s %d",stu[num].id,&stu[num].score);
			stu[num].location_number = i;
			num++;
		}
		sort(stu + num -k,stu+num,cmp); 
		stu[num - k].local_rank = 1;
		for(int j =num-k+1;j<num;j++){
			if(stu[j].score == stu[j-1].score){
				stu[j].local_rank = stu[j-1].local_rank;
			}else{
				stu[j].local_rank = j+1-(num-k);
			}
		} 
	}
	printf("%d\n",num);
	sort(stu,stu+num,cmp);
	int r =1;
	for(int i =0;i<num;i++){
		if(i > 0 && stu[i].score!=stu[i-1].score){
			r = i + 1;
		}
		printf("%s",stu[i].id);
		printf("%d %d %d\n",r,stu[i].location_number,stu[i].local_rank);
	}
	return 0;
}