1174A - Ehab Fails to Be Thanos - CodeForces Solution

constructive algorithms greedy sortings *1000

Please click on ads to support us..

Python Code: 

n = int(input())
lst = list(map(int, input().split()))
lst.sort()
if sum(lst[:n]) == sum(lst[n:]):
    print(-1)
else:
    for i in lst:
        print(i,end=" ")

C++ Code: 

/*
* Author :  <Abdoo__said\n>
*/
#include<bits/stdc++.h>
#define ll long long
#define el  '\n'
#define fast  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
 int main()
 {
     int n;
     cin>>n;
     int x[2*n];
     for (int i = 0; i < 2*n; ++i) {
         cin>>x[i];
     }
     sort(x,x+(2*n));

     ll sum1=0,sum2=0;
     for (int i = 0; i < 2*n; ++i) {
         if(i<n)
         {
             sum1+=x[i];
         }
         else
         {
             sum2+=x[i];
         }
     }
     if (sum1==sum2)
     {
         cout<<-1<<el;
     }
     else
     {
         for (int i = 0; i < 2*n; ++i) {
             cout<<x[i]<<" ";
         }
     }



 }


Comments

Submit
0 Comments
More Questions

77. Combinations
46. Permutations
226. Invert Binary Tree
112. Path Sum
1556A - A Variety of Operations
136. Single Number
169. Majority Element
119. Pascal's Triangle II
409. Longest Palindrome
1574A - Regular Bracket Sequences
1574B - Combinatorics Homework
1567A - Domino Disaster
1593A - Elections
1607A - Linear Keyboard
EQUALCOIN Equal Coins
XOREQN Xor Equation
MAKEPAL Weird Palindrome Making
HILLSEQ Hill Sequence
MAXBRIDGE Maximise the bridges
WLDRPL Wildcard Replacement
1221. Split a String in Balanced Strings
1002. Find Common Characters
1602A - Two Subsequences
1555A - PizzaForces
1607B - Odd Grasshopper
1084A - The Fair Nut and Elevator
1440B - Sum of Medians
1032A - Kitchen Utensils
1501B - Napoleon Cake
1584B - Coloring Rectangles