package mariaAndSweets;
import java.util.Collections;
import java.util.LinkedList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
final class Main {
static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) {
final int number = scanner.nextInt(), min = scanner.nextInt();
LinkedList<Integer> sweets = new LinkedList<>();
LinkedList<Integer> copy = new LinkedList<>();
for (int i = 0; i < number; i++)
sweets.add(scanner.nextInt());
scanner.close();
Set<Integer> set = new HashSet<>(sweets);
copy.addAll(set);
for (int i = 0; i < copy.size(); i++) {
if (Collections.frequency(sweets, copy.get(i)) >= min) {
Collections.sort(sweets);
StringBuilder sb = new StringBuilder();
for (Integer j : sweets)
sb.append(j + " ");
System.out.print(sb);
return;
}
}
System.out.print("Oh sh*t");
}
}LinkedList<Integer> sweets = new LinkedList<>();
StringBuilder sb = new StringBuilder();
AtomicBoolean hasMinAmount = new AtomicBoolean(false);
sweets.stream()
.collect(Collectors.toMap(Integer::intValue, integer -> 1, Math::addExact))
.forEach((candyName, amount) -> {
if (amount >= min) {
hasMinAmount.set(true);
}
for (int i = 0; i < amount; i++) {
sb.append(candyName + " ");
}
});
if (hasMinAmount.get()) {
System.out.print(sb);
} else {
System.out.println("Oh sh*t");
}
Средний
Простой
Простой
Средний
Простой