Problem J. Journey with Pigs

Problem J. Journey with Pigs
http://codeforces.com/gym/241680/problem/J
考察排序不等式
算出来单位重量在每个村庄的收益，然后生序排列
猪的重量也生序排列
此时价值最大

#include<iostream>
#include<cstdio>
#include<queue>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<set>
#include<map>
#include<stack>
#include<cstring>
#define inf 2147483647
#define ls rt<<1
#define rs rt<<1|1
#define lson ls,nl,mid,l,r
#define rson rs,mid+1,nr,l,r
#define N 100010
#define For(i,a,b) for(long long i=a;i<=b;i++)
#define p(a) putchar(a)
#define g() getchar()

using namespace std;
long long n,t;
long long dis[1010];
struct value{
    long long poi;
    long long v;
}a[1010];

struct pig{
    long long poi;
    long long w;
}b[1010];
long long ans[1010];

void in(long long &x){
    long long y=1;
    char c=g();x=0;
    while(c<'0'||c>'9'){
        if(c=='-')y=-1;
        c=g();
    }
    while(c<='9'&&c>='0'){
        x=(x<<1)+(x<<3)+c-'0';c=g();
    }
    x*=y;
}
void o(long long x){
    if(x<0){
        p('-');
        x=-x;
    }
    if(x>9)o(x/10);
    p(x%10+'0');
}

bool cmp1(pig a,pig b){
    return a.w<b.w;
}

bool cmp2(value a,value b){
    return a.v<b.v;
}

int main(){
    freopen("journey.in","r",stdin);
    freopen("journey.out","w",stdout);
    in(n);in(t);
    For(i,1,n){
        in(b[i].w);
        b[i].poi=i;
    }
    sort(b+1,b+n+1,cmp1);
    For(i,1,n)
        in(dis[i]);
    For(i,1,n){
        in(a[i].v);
        a[i].poi=i;
    }
    For(i,1,n)
        a[i].v=a[i].v-dis[i]*t;
    sort(a+1,a+n+1,cmp2);
    For(i,1,n)
        ans[a[i].poi]=b[i].poi;
    For(i,1,n-1){
        o(ans[i]);p(' ');
    }
    o(ans[n]);

    return 0;
}