D2. Sage’s Birthday (hard version) SOLUTIONS CODEFORCES

Sage’s Birthday (hard version) SOLUTIONS CODEFORCES

This is the hard version of the problem. The difference between the versions is that in the easy version all prices aiai are different. You can make hacks if and only if you solved both versions of the problem.

Today is Sage’s birthday, and she will go shopping to buy ice spheres. All nn ice spheres are placed in a row and they are numbered from 11 to nn from left to right. Each ice sphere has a positive integer price. In this version, some prices can be equal.

An ice sphere is cheap if it costs strictly less than two neighboring ice spheres: the nearest to the left and the nearest to the right. The leftmost and the rightmost ice spheres are not cheap. Sage will choose all cheap ice spheres and then buy only them.

You can visit the shop before Sage and reorder the ice spheres as you wish. Find out the maximum number of ice spheres that Sage can buy, and show how the ice spheres should be reordered.Input

The first line contains a single integer nn (1≤n≤105)(1≤n≤105) — the number of ice spheres in the shop.

The second line contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤109)(1≤ai≤109) — the prices of ice spheres.Output

In the first line print the maximum number of ice spheres that Sage can buy.

In the second line print the prices of ice spheres in the optimal order. If there are several correct answers, you can print any of them.ExampleinputCopy

7
1 3 2 2 4 5 4

outputCopy

3
3 1 4 2 4 2 5 

Note

In the sample it’s not possible to place the ice spheres in any order so that Sage would buy 44 of them. If the spheres are placed in the order (3,1,4,2,4,2,5)(3,1,4,2,4,2,5), then Sage will buy one sphere for 11 and two spheres for 22 each.

Solution:

Program C++:

#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
	cin>>n;
	int a[n],b[n];
	for(int i=0;i<n;i++)cin>>a[i];
	sort(a,a+n);
    int j=0,c=0;
	for(int i=1;i<n;i+=2,j++)b[i]=a[j];
	for(int i=0;i<n;i+=2,j++)b[i]=a[j];
	for(int i=1;i<n-1;i++){
	    if(b[i]<b[i-1] && b[i]<b[i+1])c++;
	}
	cout<<c<<endl;
	for(int i=0;i<n;i++)cout<<b[i]<<" ";
	
	return 0;
}

Program Java:

import java.util.*;
public class F {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int a[] = new int[n];
		for(int i = 0 ; i<n; i++) {
			a[i] = sc.nextInt();
		}
		Arrays.sort(a);
		int p = 1;
		int[] res = new int[n];
		int count = 0;
		boolean judge = false;
		for(int i = 0 ; i<n; i++, p+=2) {
			if(p>=n) {
				p = 0;
				judge = true;
			}
			res[p] = a[i];
			if(judge) {
				if(p+1<n && p!=n-2 ) {
					if(res[p]>res[p+1])count++;
				}
			}
		}
		System.out.println(count);
		for(int i = 0 ; i<n; i++) {
			System.out.print(res[i]);
			if(i!=n-1)System.out.print(" ");
		}
		System.out.println();
	}
}

	 		  		 		   		    		 	     	

Program Python:

n = int(input())
arr = list(map(int, input().split()))
arr.sort()
arr1 = arr[:n//2]
arr2 = arr[n//2:]
lst = [0]*n
for i in range(n//2):
    arr2.insert(i + (i + 1), arr[i])
d = 0
for i in range(1, n - 1, 2):
    if arr2[i] < arr2[i - 1] and arr2[i] < arr2[i + 1]:
        d += 1
print(d)
print(*arr2)

Related : 

Leave a Comment