Problem:
Score : 600 points

Problem Statement

Given are two sequences A and B, both of length N.
A and B are each sorted in the ascending order.
Check if it is possible to reorder the terms of B so that for each i (1 \leq i \leq N) A_i \neq B_i holds, and if it is possible, output any of the reorderings that achieve it.

Constraints

1\leq N \leq 2 \times 10^5

1\leq A_i,B_i \leq N

A and B are each sorted in the ascending order.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 \cdots A_N
B_1 B_2 \cdots B_N

Output

If there exist no reorderings that satisfy the condition, print No.

If there exists a reordering that satisfies the condition, print Yes on the first line.
After that, print a reordering of B on the second line, separating terms with a whitespace.

If there are multiple reorderings that satisfy the condition, you can print any of them.

Sample Input 1

6
1 1 1 2 2 3
1 1 1 2 2 3

Sample Output 1

Yes
2 2 3 1 1 1

Sample Input 2

3
1 1 2
1 1 3

Sample Output 2

No

Sample Input 3

4
1 1 2 3
1 2 3 3

Sample Output 3

Yes
3 3 1 2

Solution in Java (OpenJDK 11.0.6) (judge verdict: Time Limit Exceeded)

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;

 
public class Main {
	static final long MOD=1000000007;//998244353;
	public static void main(String[] args) {
		PrintWriter out = new PrintWriter(System.out);
		InputReader sc=new InputReader(System.in);
		int N=sc.nextInt();
		int[] A=sc.nextIntArray(N);
		int[] B=sc.nextIntArray(N);
		int[] acount=new int[N+1];
		int[] bcount=new int[N+1];
		for (int i = 0; i < A.length; i++) {
			acount[A[i]]++;
			bcount[B[i]]++;
		}
		PriorityQueue<Pair> apriorityQueue=new PriorityQueue<>();
		PriorityQueue<Pair> bpriorityQueue=new PriorityQueue<>();
		for (int i = 1; i < acount.length; i++) {
			if (acount[i]+bcount[i]>N) {
				System.out.println("No");
				return;
			}
		}
		ArrayList<Integer>[] arrayLis=new ArrayList[N+1];
		for (int i = 0; i < arrayLis.length; i++) {
			arrayLis[i]=new ArrayList<>();
		}
		for (int i = 1; i <= N; i++) {
			if (acount[i]==0) {
				continue;
			}
			apriorityQueue.add(new Pair(i, acount[i]+bcount[i]));
		}
		for (int i = 1; i <= N; i++) {
			if (bcount[i]==0) {
				continue;
			}
			bpriorityQueue.add(new Pair(i, acount[i]+bcount[i]));
		}
		while (!apriorityQueue.isEmpty()) {
			Pair p1=apriorityQueue.poll();
			Pair p2=bpriorityQueue.poll();
			if (p1.x==p2.x) {
				Pair x=p2;
				p2=bpriorityQueue.poll();
				bpriorityQueue.add(x);
			}
			arrayLis[p1.x].add(p2.x);
			acount[p1.x]--;
			bcount[p2.x]--;
			if (acount[p2.x]>0) {
				apriorityQueue.remove(new Pair(p2.x, acount[p2.x]+bcount[p2.x]+1));
				apriorityQueue.add(new Pair(p2.x, acount[p2.x]+bcount[p2.x]));
			}
			if (bcount[p1.x]>0) {
				bpriorityQueue.remove(new Pair(p1.x, acount[p1.x]+bcount[p1.x]+1));
				bpriorityQueue.add(new Pair(p1.x, acount[p1.x]+bcount[p1.x]));
			}
			if (acount[p1.x]>0) {
				apriorityQueue.add(new Pair(p1.x, acount[p1.x]+bcount[p1.x]));
			}
			if (bcount[p2.x]>0) {
				bpriorityQueue.add(new Pair(p2.x, acount[p2.x]+bcount[p2.x]));
			}
		}
		out.println("Yes");
		for (int i = 0; i < arrayLis.length; i++) {
			for (int j: arrayLis[i]) {
				out.println(j);
			}
		}
		out.flush();
   	}
	static class Pair implements Comparable<Pair>{
    	public int x;
    	public int y;
    	public Pair(int x,int y) {
    		this.x=x;
    		this.y=y;
    	}
    	@Override
    	public boolean equals(Object obj) {
    		if(obj instanceof Pair) {
    			Pair other = (Pair) obj;
    			return other.x==this.x && other.y==this.y;
    		}
    		return false;
    	}//同値の定義
    	@Override
    	public int hashCode() {
    		return Objects.hash(this.x,this.y);
    	}//これ書かないと正しく動作しない（要　勉強）
    	@Override
    	public int compareTo( Pair p){
    		if (this.y<p.y) {
    			return 1;
    		}
    		else if (this.y>p.y) {
    			return -1;
    		}
    		else {
    			return 0;
    		}
    	}
    }
		static class InputReader { 
		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;
		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}
 
		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}
 
		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}
 
		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}
 
		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}
 
		public boolean hasNext() {
			skip();
			return hasNextByte();
		}
 
		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}
 
		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}
 
		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}
 
		public double nextDouble() {
			return Double.parseDouble(next());
		}
 
		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}
 
		public long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}
 
		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}
	}