1025 pat ranking (25 points)

1025 PAT Ranking (25 branch )

The question

give n A set of , Each group has k Row number , Yes k Sort by the number of rows .
Number of rows ：id achievement
Sort rule ： In descending order of grades , With the same score, press id Ascending order .
Sorting needs to give each id Number of groups （ Which group ）, Global ranking and local ranking （ Ranking within the group ）

Ideas

There are sorting in the structure .
Local rankings can use additional arrays to record scores and rankings .
Be careful id It's best to use a string to represent .
There may be more than one score for 0 People who .

Code

#include<algorithm>
#include<stdio.h>
#include<map>
#include<iostream>
#include<string.h>
using namespace std;
typedef struct node{
    
	int v2,z,v;
	string id;
}node;
node x1[300007];
map<string,int>name;
map<int,string>number;
int Count=0;
bool cmp(node a,node b)
{
    
	if(a.v==b.v){
    
		return a.id<b.id;
	}else{
    
		return a.v>b.v;
	}
}
int chang(string x)
{
    
	if(name.find(x)!=name.end()){
    
		return name[x];
	}else{
    
		name[x]=Count;
		number[Count]=x;
		return Count++;
	}
}
int main()
{
    
	int n,k,v,p,temp,w,aa,bb,x2[307],x3[307],x4[307];
	string id;
	memset(x2,0,sizeof(x2));
	memset(x3,-1,sizeof(x3));// Someone's score is 0, So it's initialized to -1
	memset(x4,0,sizeof(x4));
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
    
		scanf("%d",&k);
		for(int j=0;j<k;j++){
    
			cin>>id>>v;
			p=chang(id);
			if(j==0){
    
				temp=p;
			}
			x1[p].id=id;
			x1[p].v=v;
			x1[p].z=i;
		}
	}
	sort(x1,x1+Count,cmp);
	printf("%d\n",Count);
	for(int i=0;i<Count;i++){
    
		if(x1[i].v==w&&i!=0){
    
			aa=bb;
		}else{
    
			aa=i+1;
			w=x1[i].v;
			bb=aa;
		}
		if(x1[i].v==x3[x1[i].z]&&x3[x1[i].z]!=-1){
    		//x3 Initialize to 0 There may be a problem here 
			x1[i].v2=x4[x1[i].z];
		}else{
    
			x1[i].v2=x2[x1[i].z];
		}
		x3[x1[i].z]=x1[i].v;
		x4[x1[i].z]=x1[i].v2;
		x2[x1[i].z]++;
		cout<<x1[i].id<<" "<<aa<<" "<<x1[i].z<<" "<<x1[i].v2+1<<endl;
	}
	return 0;
}