-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathScCourse.java
More file actions
71 lines (69 loc) · 1.18 KB
/
ScCourse.java
File metadata and controls
71 lines (69 loc) · 1.18 KB
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
60
61
62
63
64
65
66
67
68
69
70
71
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.StringTokenizer;
import java.util.Scanner;
public class ScCourse
{
public static int n;
public static int m;
public static int [] e;
public static int [] h;
public static int[] avg;
public static int next(int index)
{
int i = index+1;
while (i < m)
{
if (h[i] >= h[index])
{
return i;
}
i++;
}
return -1;
}
public static void main(String [] args) throws IOException
{
Scanner sc = new Scanner(System.in);
n = sc.nextInt();
m = sc.nextInt();
avg = new int[n];
e = new int[n];
for (int i = 0; i < n; i++)
{
e[i] = sc.nextInt();
}
h = new int[m];
for (int i = 0; i < m; i++)
{
h[i] = sc.nextInt();
}
for (int i = 0; i < n; i++)
{
int curr = e[i];
int index = 0;
while (curr >= 0 && index < m)
{
curr -= h[index];
if (curr < 0)
break;
int next = next(index);
if (next == -1)
{
avg[i] = m;
break;
}
else
{
avg[i] += (next - index);
index = next;
}
}
}
double total = 0;
for (int i = 0; i < n; i++)
total += avg[i];
System.out.println(total / n);
}
}