数列有序!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34179 Accepted Submission(s): 14589
Problem Description
有n(n<=100)个整数,已经按照从小到大顺序排列好,现在另外给一个整数x,请将该数插入到序列中,并使新的序列仍然有序。
Input
输入数据包含多个测试实例,每组数据由两行组成,第一行是n和m,第二行是已经有序的n个数的数列。n和m同时为0标示输入数据的结束,本行不做处理。
Output
对于每个测试实例,输出插入新的元素后的数列。
Sample Input
3 3 1 2 4 0 0
Sample Output
1 2 3 4package hdu2019; import java.io.BufferedInputStream; import java.util.ArrayList; import java.util.Collections; import java.util.List; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(new BufferedInputStream(System.in)); List<Integer> list = new ArrayList<Integer>(); while (cin.hasNext()) { int n = cin.nextInt(); int m = cin.nextInt(); if (n + m == 0) break; list.clear(); for (int i = 0; i < n; i++) { list.add(cin.nextInt()); //添加元素 } list.add(m); Collections.sort(list); //排序 for (int i = 0; i<list.size(); i++){ if(i==0){ System.out.print(list.get(i)); }else{ System.out.print(" "+list.get(i)); } } System.out.println(); } } }