-
Notifications
You must be signed in to change notification settings - Fork 2
/
Main.java
59 lines (48 loc) · 1.6 KB
/
Main.java
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
52
53
54
55
56
57
58
59
package L2_003;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
public class Main {
static class Cake implements Comparable<Cake>{
double amount;
double price;
double value;
public Cake(double amount, double price, double value) {
this.amount = amount;
this.price = price;
this.value = value;
}
@Override
public int compareTo(Cake o) {
return value > o.value ? -1 : 1;
}
}
public static void main(String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] in = br.readLine().split(" ");
int n = Integer.parseInt(in[0]);
int d = Integer.parseInt(in[1]);
ArrayList<Cake> list = new ArrayList<Cake>();
String[] w = br.readLine().split(" "), pr = br.readLine().split(" ");
for (int i = 0; i < n; i++) {
double m = Double.parseDouble(w[i]);
double p = Double.parseDouble(pr[i]);
double value = p/m;
list.add(new Cake(m, p, value));
}
Collections.sort(list);
double sum = 0;
for (int i = 0; i < n; i++) {
if (d - list.get(i).amount >= 0) {
sum += list.get(i).price;
d -= list.get(i).amount;
} else {
sum += list.get(i).value * d;
break;
}
}
System.out.println(String.format("%.2f", sum));
}
}