[基础题解]Journey with pigs

/*************************************************************************
    > File Name: main.c
    > Author:qusijun
    > Mail: wiilen.lian@gmail.com 
    > Created Time: 2013年08月08日 星期四 10时19分06秒
 ************************************************************************/

#include<stdio.h>
#include<stdlib.h>
#define ll long long
typedef struct 
{
    ll value;
    int position;

}Node;

Node weight[1005],earn[1005];
int cmp(const void *a,const void *b)
{
    Node *aa = (Node*)a;
    Node *bb = (Node*)b;
    if (aa->value>bb->value) return 1;
    else return -1;

}
int main(void)
{
    int i,j,n;
    ll t;
    while (scanf("%d%lld",&n,&t)!=EOF)
    {
        //int per_wei,per_cost,distance;
        for (i=1;i<=n;i++)
        {
            scanf("%lld",&weight[i].value);
            weight[i].position = i;
        }

        ll distance[1005];
        for (i=1;i<=n;i++)
        {
            scanf("%lld",&distance[i]);
        }

        for (i=1;i<=n;i++)
        {
            ll x;
            scanf("%lld",&x);
            earn[i].value = x - t*distance[i];
            earn[i].position = i;
        }
        //德马西亚！
        qsort(weight+1,n,sizeof(weight[0]),cmp);
        qsort(earn+1,n,sizeof(earn[0]),cmp);

        int ans[1005];
        for (i=1;i<=n;i++)
        {
            printf("%d",earn[i].position);
            ans[earn[i].position] = weight[i].position;
        }

        for (i=1;i<=n;i++)
        {
            printf("%d ",ans[i]);
        }
        printf("
");

        


    }
    return 0;
}