HDU 2019 數列有序
阿新 • • 發佈:2018-12-24
import java.util.Scanner; public class Main { public static void main(String[] args) { @SuppressWarnings("resource") Scanner in = new Scanner(System.in); while(in.hasNext()) { int n = in.nextInt(); int m = in.nextInt(); int arr[] = new int[n]; if(n>0 && n<=100) { for(int i=0;i<n;i++) { arr[i] = in.nextInt(); } OrderlySeries(arr,m); } } } public static void OrderlySeries(int[] arr, int m) { int arc[] = new int[arr.length+1]; for(int i=0;i<arr.length;i++) { arc[i] = arr[i]; } arc[arc.length-1] = m; String str = " "; for(int i=0;i<arc.length;i++) { for(int j=0;j<arc.length-i-1;j++) { if(arc[j]>arc[j+1]) { int temp = arc[j]; arc[j] = arc[j+1]; arc[j+1] = temp; } } } for(int i=0;i<arc.length;i++){ str = str + arc[i] + " "; } System.out.println(str.trim()); } }