Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.*;
- public class Izziv3 {
- public static Scanner in = new Scanner(System.in);
- public static void main(String[] args) {
- int n = in.nextInt();
- int m = in.nextInt();
- int[] urejena = new int[n + m];
- int[] a = new int[n];
- for (int i = 0; i < n; i++) {
- a[i] = in.nextInt();
- }
- int[] b = new int[m];
- for (int i = 0; i < m; i++) {
- b[i] = in.nextInt();
- }
- int indexPrve = 0;
- int indexDruge = 0;
- int indexPrave = 0;
- while (indexPrve < a.length && indexDruge < b.length) {
- if (a[indexPrve] <= b[indexDruge]) {
- // Ce je element iz tabele a manjsi od elementa iz tabele b
- urejena[indexPrave] = a[indexPrve];
- System.out.printf("a");
- indexPrve++;
- indexPrave++;
- } else {
- //Drugace
- urejena[indexPrave] = b[indexDruge];
- System.out.printf("b");
- indexDruge++;
- indexPrave++;
- }
- }
- if (indexPrve < a.length) {
- while (indexPrve < a.length) {
- urejena[indexPrave] = a[indexPrve];
- System.out.printf("a");
- indexPrave++;
- indexPrve++;
- }
- }
- if (indexDruge < b.length) {
- while (indexDruge < b.length) {
- urejena[indexPrave] = b[indexDruge];
- System.out.printf("b");
- indexPrave++;
- indexDruge++;
- }
- }
- System.out.println();
- for (int i = 0; i < urejena.length; i++) {
- System.out.printf("%d ", urejena[i]);
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement