-
Notifications
You must be signed in to change notification settings - Fork 10
/
CAR.cpp
51 lines (41 loc) 路 1.01 KB
/
CAR.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef unsigned long long ull;
#define X first
#define Y second
#define pb push_back
#define mp make_pair
#define ep emplace_back
#define EL printf("\n")
#define sz(A) (int) A.size()
#define FOR(i,l,r) for (int i=l;i<=r;i++)
#define FOD(i,r,l) for (int i=r;i>=l;i--)
#define fillchar(a,x) memset(a, x, sizeof (a))
#define faster ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
struct data {
int val, time, id;
};
const int N = 10010;
int n;
data a[N];
ll ans, sum;
bool cmp(data u, data v) {
return (ll)u.val * v.time > (ll)u.time * v.val;
}
int main() {
// freopen("INP.TXT", "r", stdin);
// freopen("OUT.TXT", "w", stdout);
scanf("%d", &n);
FOR(i,1,n) scanf("%d", &a[i].val), sum += (ll)a[i].val;
FOR(i,1,n) scanf("%d", &a[i].time), a[i].id = i;
sort(a+1, a+n+1, cmp);
FOR(i,1,n) {
ans += sum * a[i].time;
sum -= a[i].val;
}
printf("%lld\n", ans);
FOR(i,1,n) printf("%d ", a[i].id);
return 0;
}