-
Notifications
You must be signed in to change notification settings - Fork 0
/
AuthorSol.java
146 lines (132 loc) · 3.01 KB
/
AuthorSol.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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.TreeSet;
public class AuthorSol {
public static void main(String[] args) {
FastScanner fs = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
int T = 1;
//T = fs.nextInt();
for (int tc = 0; tc < T; tc++) {
int n = fs.nextInt();
int k = fs.nextInt();
ArrayList<Pair> res = new ArrayList<>(n);
ArrayList<Integer> arr = new ArrayList<>(n);
for (int i = 0; i < n; i++) {
res.add(new Pair(fs.nextInt(), i + 1));
arr.add(res.get(i).first);
}
Collections.sort(res, new Comparator<Pair>() {
@Override
public int compare(Pair a, Pair b) {
if (a.first > b.first) {
return -1;
}
return 1;
}
});
System.out.println();
Collections.sort(res.subList(0, k), new Comparator<Pair>() {
@Override
public int compare(Pair a, Pair b) {
if (a.second < b.second) {
return -1;
}
return 1;
}
});
int last = 0;
int sum = 0;
for (int i = 0; i < k - 1; i++) {
sum += Collections.max(arr.subList(last, res.get(i).second));
last = res.get(i).second;
}
sum += Collections.max(arr.subList(last, n));
System.out.println(sum);
last = 0;
for (int i = 0; i < k - 1; i++) {
System.out.print(res.get(i).second - last + " ");
last = res.get(i).second;
}
System.out.println(n - last);
}
out.close();
}
static class Pair {
int first;
int second;
Pair(int first, int second) {
this.first = first;
this.second = second;
}
}
static void sort(int[] a) {
ArrayList<Integer> arr = new ArrayList<>();
for (int x : a) {
arr.add(x);
}
Collections.sort(arr);
for (int i = 0; i < a.length; i++) {
a[i] = arr.get(i);
}
}
static void swap(int[] a, int x, int y) {
int temp = a[x];
a[x] = a[y];
a[y] = temp;
}
static class FastScanner {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
String next() {
while (!st.hasMoreTokens()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
int[] readArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
return a;
}
long[] readLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = nextLong();
}
return a;
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
String str = "";
try {
str = br.readLine();
} catch(IOException e) {
e.printStackTrace();
}
return str;
}
}
}