排序题与sort函数的应用

排序提醒的常用解题步骤

  1. 结构体相关定义
  2. cmp函数的编写
  3. 排名的实现

一般规则:分数不同的排名不同,分数相同的排名相同但是占用一个排位。

先将数组第一个个体的排名记为1,然后遍历剩余个体:

如果当前个体的分数等于上一个个体的分数,那么当前个体的排名等于上一个个体的排名;

否则,当前个体的排名等于数组下标加1.

stu[0].r=1;
for(int i=1;i<n;i++)
{
    if(stu[i].score==stu[i-1].score) stu[i].r=stu[i-1].r;
    else stu[i].r=i+1;
}

例题

Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhejiang University. Each test is supposed to run simultaneously in several places, and the ranklists will be merged immediately after the test. Now it is your job to write a program to correctly merge all the ranklists and generate the final rank.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive number N (≤100), the number of test locations. Then N ranklists follow, each starts with a line containing a positive integer K (≤300), the number of testees, and then K lines containing the registration number (a 13-digit number) and the total score of each testee. All the numbers in a line are separated by a space.

Output Specification:

For each test case, first print in one line the total number of testees. Then print the final ranklist in the following format:

registration_number final_rank location_number local_rank

The locations are numbered from 1 to N. The output must be sorted in nondecreasing order of the final ranks. The testees with the same score must have the same rank, and the output must be sorted in nondecreasing order of their registration numbers.

Sample Input:

2
5
1234567890001 95
1234567890005 100
1234567890003 95
1234567890002 77
1234567890004 85
4
1234567890013 65
1234567890011 25
1234567890014 100
1234567890012 85

Sample Output:

9
1234567890005 1 1 1
1234567890014 1 2 1
1234567890001 3 1 2
1234567890003 3 1 2
1234567890004 5 1 4
1234567890012 5 2 2
1234567890002 7 1 5
1234567890013 8 2 3
1234567890011 9 2 4

完全按照接替套路来就可以,对于每个考场的排名如果不是特别确定数组下标的关系,可以先输出一下。

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
struct Student{
	char id[15];
	int location_number;
	int score;
	int local_rank;
	int whole_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;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>k;
		for(int j=0;j<k;j++)
		{
			cin>>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-(num-k)+1;        
		}	
	}
	sort(stu,stu+num,cmp);
	stu[0].whole_rank=1;
	for(int j=1;j<num;j++)
	{
		if(stu[j].score==stu[j-1].score) stu[j].whole_rank=stu[j-1].whole_rank;
		else stu[j].whole_rank=j+1;
	}
	cout<<num<<endl;
	for(int i=0;i<num;i++)
	{
		cout<<stu[i].id<<" "<<stu[i].whole_rank<<" "<<stu[i].location_number<<" "<<stu[i].local_rank<<endl;
	}
	return 0;
 } 
发布了59 篇原创文章 · 获赞 13 · 访问量 1万+
展开阅读全文

没有更多推荐了,返回首页

©️2019 CSDN 皮肤主题: 深蓝海洋 设计师: CSDN官方博客

分享到微信朋友圈

×

扫一扫,手机浏览