// #include "pch.h" #include <iostream> #include <algorithm> #include <map> #include <set> #include <queue> #include <bitset> #include <climits> #include <string> #include <cmath> #include <bitset> #include <complex> #include <functional> #include <ctime> #include <cassert> #include <fstream> #include <stack> #include <random> typedef long long ll; typedef std::pair<int, int> Pii; typedef std::pair<long long, long long> Pll; typedef std::pair<double, double> Pdd; #define rip(i, n, s) for (int i = (s);i < (int)( n ); i++) #define all(a) a.begin(), a.end() #define MM << " " << template<typename T> using MaxHeap = std::priority_queue<T>; template<typename T> using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>; template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } # ifndef ONLINE_JUDGE template<typename T> void vdeb(std::vector<T> &bb) { for (int i = 0;i < bb.size();i++) { if (i == bb.size() - 1) std::cout << bb[i]; else std::cout << bb[i] << ' '; } std::cout << '\n'; } template<typename T> void vdeb(std::vector<std::vector<T>> &bb) { for (int i = 0;i < bb.size();i++) { std::cout << i << ' '; vdeb(bb[i]); } std::cout << '\n'; } # endif using namespace std; int main() { int n; cin >> n; vector<ll> a(n); rip(i,n,0) cin >> a[i]; vector<ll> b(n); rip(i,n,0) cin >> b[i]; map<ll, ll> mp; rip(i,n,0) { if(mp.count(a[i])) { mp[a[i]] += b[i]*2; } else { mp[a[i]] = b[i]*2; } } ll prv = (*mp.begin()).first, now = 0, dd = 0, ans =LLONG_MAX/2, ans_id = prv; rip(i,n,0) { now += abs(prv-a[i]) * b[i]; dd -= b[i]; } for(auto i:mp) { now += dd*(i.first-prv); prv = i.first; dd += i.second; if(chmin(ans, now)) ans_id = prv; } cout << ans_id MM ans << endl; }