## cakes

there are some naughty little cakes(less than 1000), each cake has a numberthey stand in plates whose number start from 0 increasing in turn . The process of waiting for being taste by small Q is very boring so they made a game .According to the serial numbers of the cake from small to large lying on a plate ,but they forgot the plates that they lying before, if they don't go back, small Q will be very angry.So, smart programmer monkey  can you help them?

Multiple sets of test data
first give you a digsit the number of cakes;
then there are n digsits

。。。

4
4 2 1 3
5
4 3 1 2 5

2 1 3 0
2 3 1 0 4

maybe they are equal to others，if so ,printf the order before

Hait：注意提示的内容。。。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct zz
{
int x;
int y;
}q[1010];
int cmp(zz a,zz b)
{
if(a.x==b.x)
return a.y<b.y;
return a.x<b.x;
}
int main()
{
int n,i;
while(scanf("%d",&n)!=EOF)
{
for(i=0;i<n;i++)
{
scanf("%d",&q[i].x);
q[i].y=i;
}
sort(q,q+n,cmp);
for(i=0;i<n-1;i++)
printf("%d ",q[i].y);
printf("%d\n",q[n-1].y);
}
return 0;
} 

#### NYOJ 1163 cakes（自己想复杂了）

2015-09-11 08:34:15

#### 1163: 亲和串（字符串）

2017-08-26 14:25:46

#### COJ 1163: 寒衣调

2014-07-25 21:06:00

#### NYOJ InterestingPunch-Bowl

2017-04-14 20:40:24

#### hdoj.1163 Eddy's digital Roots 20140813

2014-08-13 09:03:00

#### NYOJ A+B IV 小数相加（大数问题）

2016-07-27 08:54:16

#### nyoj 1085 数单词

2016-05-18 20:11:28

#### 一种排序（nyoj8）（简单排序）

2014-11-20 00:02:28

#### NYOJ_4 ASCII码排序

2015-05-10 15:57:17

#### NYOJ：奇怪的排序

2016-09-06 20:37:12

## 不良信息举报

nyoj cakes 1163 (排序) 水