Путешествие со свиньями

profit = -1e18 - 1;
checkprofit = (cp[M].first) - (cp[M].second * t);

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
int main() {
    long long n, t, pig, city, price, R, profit, checkprofit;
    cin >> n >> t;
 
    vector <pair<long long, long long>> pigs;
    vector <long long> cities;
    vector <long long> prices;
    vector <pair<long long, long long>> cp;
    vector <long long> ans(n);
 
 
    for (long long i = 0; i < n; ++i){
        cin >> pig;
        pigs.push_back(make_pair(pig, i));
    }
 
    for (long long i = 0; i < n; ++i){
        cin >> city;
        cities.push_back(city);
    }
 
    for (long long i = 0; i < n; ++i){
        cin >> price;
        prices.push_back(price);
    }
 
    for (long long i = 0; i < n; ++i){
        cp.push_back(make_pair(prices[i], cities[i]));
    }
 
    sort(begin(pigs), end(pigs));
 
    for (long long i = 0; i < n; ++i){
        profit = -1e18 - 1;
        for (long long M = 0; M < n; ++M){
            checkprofit = (cp[M].first) - (cp[M].second * t);
            if (checkprofit > profit){
                profit = checkprofit;
                R = M;
            }
        }
        ans[R] = pigs[n - 1 - i].second;
        cp[R].first = -1e18 - 1;
    }
 
    for (auto i : ans){
        cout << i + 1 << " ";
    }
 
    return 0;
}

#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <deque>
#include <random>
#include <string>
 
using namespace std;
 
typedef long long ll;
 
int main() {
    ll n, k; cin >> n >> k;
    vector<pair<ll,ll>>a(n);
    for (int i = 0; i < n; i++) 
        cin >> a[i].first, a[i].second = i;
    vector<ll>d(n), p(n);
    vector<pair<ll,ll>>prof(n);
    for (int i = 0; i < n; i++) 
        cin >> d[i];
    for (int i = 0; i < n; i++) {
        cin >> p[i];
        prof[i].first = p[i] - k * d[i];
        prof[i].second = i;
    }
    sort(prof.begin(), prof.end());
    reverse(prof.begin(), prof.end());
    sort(a.begin(), a.end());
    reverse(a.begin(), a.end());
 
    vector<ll>res(n);
    for (int i = 0; i < n; i++) 
        res[prof[i].second] = a[i].second;
    for (auto to: res ) 
        cout << to + 1 << " ";
}