package com.qin.problem;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.Scanner;
public class Pinduoduo {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
while(in.hasNext()){
String str = in.nextLine();
String[] s = str.split(";");
int count = Integer.parseInt(s[1]);
String string = s[0];
String[] strings = string.split(",");
int[] num = new int[strings.length];
for (int i=0;i<strings.length;i++){
num[i] = Integer.parseInt(strings[i]);
}
ArrayList<Integer> odd = new ArrayList<>();
ArrayList<Integer> even = new ArrayList<>();//偶数
for (int i = 0; i < num.length; i++){
if ((num[i] & 1) == 0) even.add(num[i]);
else odd.add(num[i]);
}
// 降序
odd.sort(new Comparator<Integer>() {
@Override
public int compare(Integer t1, Integer t2 ) {
return t2.compareTo(t1);
}
});
even.sort(new Comparator<Integer>() {
@Override
public int compare(Integer t1, Integer t2 ) {
return t2.compareTo(t1);
}
});
// 输出
if (even.size() >= count){
for (int i = 0; i<count; i++){
if (i == even.size()-1) System.out.print(even.get(i));
else System.out.print(even.get(i)+","); // 输出
}
}else {
for (int i = 0; i<even.size(); i++){
if (i == even.size()-1) System.out.print(even.get(i));
else System.out.print(even.get(i)+","); // 输出
}
for(int i = 0; i < count - even.size(); i++){
if (i == count - even.size() -1) System.out.print(odd.get(i));
else System.out.println(odd.get(i)+",");
}
}
}
}
}
题目
最新推荐文章于 2022-12-21 10:33:14 发布