## Avoiding Zero Problem solution Codeforces Global Round 11-

This Problem is taken from codeforces global round 11. This is a very simple problem and strongly recommended to try this problem yourself before jumping to a solution directly.

### Problem statement-

A. Avoiding Zero

time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given an array of $n$ integers ${a}_{1},{a}_{2},\dots ,{a}_{n}$.

You have to create an array of $n$ integers ${b}_{1},{b}_{2},\dots ,{b}_{n}$ such that:

• The array $b$ is a rearrangement of the array $a$, that is, it contains the same values and each value appears the same number of times in the two arrays. In other words, the multisets $\left\{{a}_{1},{a}_{2},\dots ,{a}_{n}\right\}$ and $\left\{{b}_{1},{b}_{2},\dots ,{b}_{n}\right\}$ are equal.

For example, if $a=\left[1,-1,0,1\right]$, then $b=\left[-1,1,1,0\right]$ and $b=\left[0,1,-1,1\right]$ are rearrangements of $a$, but $b=\left[1,-1,-1,0\right]$ and $b=\left[1,0,2,-3\right]$ are not rearrangements of $a$.

• For all $k=1,2,\dots ,n$ the sum of the first $k$ elements of $b$ is nonzero. Formally, for all $k=1,2,\dots ,n$, it must hold
${b}_{1}+{b}_{2}+\cdots +{b}_{k}\ne 0\phantom{\rule{thinmathspace}{0ex}}.$

If an array ${b}_{1},{b}_{2},\dots ,{b}_{n}$ with the required properties does not exist, you have to print NO.

Input

Each test contains multiple test cases. The first line contains an integer $t$ ($1\le t\le 1000$) — the number of test cases. The description of the test cases follows.

The first line of each testcase contains one integer $n$ ($1\le n\le 50$)  — the length of the array $a$.

The second line of each testcase contains $n$ integers ${a}_{1},{a}_{2},\dots ,{a}_{n}$ ($-50\le {a}_{i}\le 50$)  — the elements of $a$.

Output

For each testcase, if there is not an array ${b}_{1},{b}_{2},\dots ,{b}_{n}$ with the required properties, print a single line with the word NO.

Otherwise print a line with the word YES, followed by a line with the $n$ integers ${b}_{1},{b}_{2},\dots ,{b}_{n}$.

If there is more than one array ${b}_{1},{b}_{2},\dots ,{b}_{n}$ satisfying the required properties, you can print any of them.

Example
input
Copy
4
4
1 -2 3 -4
3
0 0 0
5
1 -1 1 -1 1
6
40 -31 -9 0 13 -40

output
Copy
YES
1 -2 3 -4
NO
YES
1 1 -1 1 -1
YES
-40 13 40 0 -9 -31

Note

Explanation of the first testcase: An array with the desired properties is $b=\left[1,-2,3,-4\right]$. For this array, it holds:

• The first element of $b$ is $1$.
• The sum of the first two elements of $b$ is $-1$.
• The sum of the first three elements of $b$ is $2$.
• The sum of the first four elements of $b$ is $-2$.

Explanation of the second testcase: Since all values in $a$ are $0$, any rearrangement $b$ of $a$ will have all elements equal to $0$ and therefore it clearly cannot satisfy the second property described in the statement (for example because ${b}_{1}=0$). Hence in this case the answer is NO.

Explanation of the third testcase: An array with the desired properties is $b=\left[1,1,-1,1,-1\right]$. For this array, it holds:

• The first element of $b$ is $1$.
• The sum of the first two elements of $b$ is $2$.
• The sum of the first three elements of $b$ is $1$.
• The sum of the first four elements of $b$ is $2$.
• The sum of the first five elements of $b$ is $1$.

Explanation of the fourth testcase: An array with the desired properties is $b=\left[-40,13,40,0,-9,-31\right]$. For this array, it holds:

• The first element of $b$ is $-40$.
• The sum of the first two elements of $b$ is $-27$.
• The sum of the first three elements of $b$ is $13$.
• The sum of the first four elements of $b$ is $13$.
• The sum of the first five elements of $b$ is $4$.
• The sum of the first six elements of $b$ is $-27$.

### Solution-

According to the problem, it is not possible to make array B  if sum of all elements of array A is zero.
so if the sum of all elements of the array A is is zero we will simply print NO otherwise we will pint Yes.
Now our task is to print array B too. so we have two choices now either sum of all elements of array A is greater than 0 or less than 0.
if sum >0 we will print array A in non-increasing order because in this case sum of element b at any point can not equal to 0. else we print array A in increasing order.
Code discussion It's a community where you people helps each other.

Complete code of this Problem-

### codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster

Codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster- Codeforces is one of the most popular platforms for competitive programmers and  codeforces rating matters a lot  .  Competitive Programming  teaches you to find the easiest solution in the quickest possible way. CP enhances your problem-solving and debugging skills giving you real-time fun. It's brain-sport. As you start solving harder and harder problems in live-contests your analytical and rational thinking intensifies. To have a good codeforces profile makes a good impression on the interviewer. If you have a good  codeforces profile so it is very easy to get a referral for product base company like amazon, google , facebook etc.So in this blog I have explained everything about codeforces rating system. What are different titles on codeforces- based on rating codeforces divide rating into 10 part. Newbie Pupil Specialist Expert Candidate Codemaster Master International Master Grandmaster Internat

### Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code

Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code - Apple Division CSES Problem Solution Easy Explanation. Apple division is problem is taken form cses introductory problem set.Let's Read Problem statement first. Problem Statement- Time limit:  1.00 s   Memory limit:  512 MB There are  n n  apples with known weights. Your task is to divide the apples into two groups so that the difference between the weights of the groups is minimal. Input The first input line has an integer  n n : the number of apples. The next line has  n n  integers  p 1 , p 2 , … , p n p 1 , p 2 , … , p n : the weight of each apple. Output Print one integer: the minimum difference between the weights of the groups. Constraints 1 ≤ n ≤ 20 1 ≤ n ≤ 20 1 ≤ p i ≤ 10 9 1 ≤ p i ≤ 10 9 Example Input: 5 3 2 7 4 1 Output: 1 Explanation: Group 1 has weights 2, 3 and 4 (total weight 9), and group 2 has weights 1 and 7 (total weight 8). Join Telegram channel for code discussi

### Movie Festival CSES problem set solution

Movie Festival CSES problem set solution - Problem statement-  Time limit:  1.00 s   Memory limit:  512 MB In a movie festival  n n  movies will be shown. You know the starting and ending time of each movie. What is the maximum number of movies you can watch entirely? Input The first input line has an integer  n n : the number of movies. After this, there are  n n  lines that describe the movies. Each line has two integers  a a  and  b b : the starting and ending times of a movie. Output Print one integer: the maximum number of movies. Constraints 1 ≤ n ≤ 2 ⋅ 10 5 1 ≤ n ≤ 2 ⋅ 10 5 1 ≤ a < b ≤ 10 9 1 ≤ a < b ≤ 10 9 Example Input: 3 3 5 4 9 5 8 Output: 2 Solution - Step -1 take input in a vector as a pair first element is ending time ans second element is starting time Step -2 sort the vector in increasing order because we will watch that movie which is ending first. Step -3 iterate over vector and calculate ans .           follow code below-