Codeforces Round #563 (Div. 2) A. Ehab Fails to Be Thanos

链接：https://codeforces.com/contest/1174/problem/A

题意：

You're given an array aa of length 2n2n. Is it possible to reorder it in such way so that the sum of the first nn elements isn't equal to the sum of the last nn elements?

思路：

排序后求前一半和后一半的和比较。

代码：

#include <bits/stdc++.h>using namespace std;typedef long long LL;
const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7;
int n, m, k, t;int a[2010];int main()
{cin >> n;for (int i = 1;i <= 2*n;i++)cin >> a[i];sort(a+1, a+1+2*n);if (accumulate(a+1, a+1+n, 0) == accumulate(a+n+1, a+1+2*n, 0))cout << -1 << endl;else{for (int i = 1; i <= 2 * n; i++)cout << a[i] << ' ';cout << endl;}return 0;
}

转载于:https://www.cnblogs.com/YDDDD/p/10972855.html

Codeforces Round #563 (Div. 2) A. Ehab Fails to Be Thanos相关推荐

Codeforces Round #563 (Div. 2)-F. Ehab and the Big Finale
地址:https://codeforces.com/contest/1174/problem/F 思路:思维+分治官方题解:https://codeforces.com/blog/entry/673 ...
Codeforces Round #563 (Div. 2) F. Ehab and the Big Finale
后续: 点分治标程使用father数组比使用vis数组优秀(不需要对vis初始化) https://codeforces.com/problemset/problem/1174/F https:/ ...
Codeforces Round #563 (Div. 2)/CF1174
Codeforces Round #563 (Div. 2)/CF1174 CF1174A Ehab Fails to Be Thanos 其实就是要\(\sum\limits_{i=1}^n a_i ...
Codeforces Round #628 (Div. 2) F. Ehab‘s Last Theorem dfs树
传送门文章目录题意: 思路: 题意: 给你个nnn个点mmm条边的图,可以选择完成以下两个任务中的一个: (1)(1)(1)找出大小恰好为n\sqrt nn的一个独立集. (2)(2)(2)找出 ...
Codeforces Round #628 (Div. 2) E. Ehab‘s REAL Number Theory Problem 巧妙的质因子建图
传送门文章目录题意: 思路: 题意: 给你nnn个数,每个数的因子个数不超过777个,选出最少的数使其乘积为平方数. n≤1e5n\le 1e5n≤1e5 思路: 由于因子不超过777个,所以由约 ...
Codeforces Round #649 (Div. 2)C. Ehab and Prefix MEXs[排列的构造]
C. Ehab and Prefix MEXs 题目大意: 解题思路:题目说保证a数组是非递减的,那么如果某位置a[i]!=a[i−1]a[i]!=a[i-1]a[i]!=a[i−1]那么这个位置ii ...
Codeforces Round #628 (Div. 2)C - Ehab and Path-etic MEXs
C - Ehab and Path-etic MEXs 题目链接简要描述: 从一个点到另一个点出发,所经过的边组成一个集合, 这些集合中所不包含的最小自然数为mex(u,v),要求使所有的mex(u ...
Codeforces Round #628 (Div. 2) C. Ehab and Path-etic MEXs
C. Ehab and Path-etic MEXs 题目链接-C. Ehab and Path-etic MEXs Note The tree from the second sample: 题目大 ...
Codeforces Round #628 (Div. 2) D. Ehab the Xorcist
D. Ehab the Xorcist 题目链接-D. Ehab the Xorcist 题目大意给定两个数字 u 和 v ,构造一个最短的序列a满足a1⊕a2⊕-⊕an=u 并且 a1+a2+-+ ...
【Codeforces Round #525(Div. 2)】Ehab and another another xor problem（思维+异或）
题目链接 D. Ehab and another another xor problem time limit per test 1 second memory limit per test 256 ...

Codeforces Round #563 (Div. 2) A. Ehab Fails to Be Thanos

链接：https://codeforces.com/contest/1174/problem/A

题意：

思路：

代码：

Codeforces Round #563 (Div. 2) A. Ehab Fails to Be Thanos相关推荐

最新文章

热门文章