codeforces 551A GukiZ and Contest

最新推荐文章于 2018-09-02 17:27:23 发布

风吹过的烟花

最新推荐文章于 2018-09-02 17:27:23 发布

阅读量324

点赞数

分类专栏： ACM算法_水题

本文链接：https://blog.csdn.net/zhang__liuchen/article/details/76086645

版权

ACM算法_水题专栏收录该内容

76 篇文章 0 订阅

订阅专栏

点击打开链接

Professor GukiZ likes programming contests. He especially likes to rate his students on the contests he prepares. Now, he has decided to prepare a new contest.

In total, n students will attend, and before the start, every one of them has some positive integer rating. Students are indexed from 1 to n. Let's denote the rating of i-th student as ai. After the contest ends, every student will end up with some positive integer position. GukiZ expects that his students will take places according to their ratings.

He thinks that each student will take place equal to $\text{[math]}$ . In particular, if student A has rating strictly lower then student B, A will get the strictly better position than B, and if two students have equal ratings, they will share the same position.

GukiZ would like you to reconstruct the results by following his expectations. Help him and determine the position after the end of the contest for each of his students if everything goes as expected.

Input

The first line contains integer n (1 ≤ n ≤ 2000), number of GukiZ's students.

The second line contains n numbers a1, a2, ... an (1 ≤ ai ≤ 2000) where ai is the rating of i-th student (1 ≤ i ≤ n).

Output

In a single line, print the position after the end of the contest for each of n students in the same order as they appear in the input.

   Examples 
 
     input 
   
3
1 3 3

     output 
   
3 1 1

     input 
   
1
1

     output 
   
1

     input 
   
5
3 5 3 4 5

     output 
   
4 1 4 3 1

Note

In the first sample, students 2 and 3 are positioned first (there is no other student with higher rating), and student 1 is positioned third since there are two students with higher rating.

In the second sample, first student is the only one on the contest.

In the third sample, students 2 and 5 share the first position with highest rating, student 4 is next with third position, and students 1 and 3are the last sharing fourth position.

题意：有学生的分数进行排名，可以同名次，所以按分数排名，再返回来，输出。

#include<stdio.h>
#include<algorithm>
using namespace std;
struct node
{
    int a,b,c;
} s[2010];
int compa(node a,node b)
{
    return a.a>b.a;
}
int comp(node x,node y)
{
    return x.b<y.b;
}
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=0; i<n; i++)
    {
        scanf("%d",&s[i].a);
        s[i].b=i;
    }
    sort(s,s+n,compa);
    s[0].c=1;
    int w=1;
    for(int i=1; i<n; i++)
    {
        if(s[i].a==s[i-1].a)
        {
            s[i].c=s[i-1].c;
            w++;
        }
        else
        {
            w++;
            s[i].c=w;
        }
    }
    sort(s,s+n,comp);
    for(int i=0; i<n; i++)
    {
        if(i==0)
            printf("%d",s[i].c);
        else
            printf(" %d",s[i].c);
    }
    printf("\n");
    return 0;
}