Integer Set Partition
2016-12-05 16:57
267 查看
Given a set of N (> 1) positive integers, you are supposed to partition them into two disjoint sets A1 and A2 of n1 and n2 numbers,
respectively. Let S1 and S2 denote the sums of all the numbers in A1 and A2, respectively. You are supposed to make the partition
so that |n1 - n2| is minimized first, and then |S1 - S2| is maximized.
Input Specification:
Each input file contains one test case. For each case, the first line gives an integer N (2 <= N <= 105), and then N positive integers follow in the next line, separated by spaces. It is guaranteed that all the integers and
their sum are less than 231.
Output Specification:
For each case, print in a line two numbers: |n1 - n2| and |S1 - S2|, separated by exactly one space.
Sample Input 1:
Sample Output 1:
Sample Input 2:
Sample Output 2:
1 9359
一道水题
respectively. Let S1 and S2 denote the sums of all the numbers in A1 and A2, respectively. You are supposed to make the partition
so that |n1 - n2| is minimized first, and then |S1 - S2| is maximized.
Input Specification:
Each input file contains one test case. For each case, the first line gives an integer N (2 <= N <= 105), and then N positive integers follow in the next line, separated by spaces. It is guaranteed that all the integers and
their sum are less than 231.
Output Specification:
For each case, print in a line two numbers: |n1 - n2| and |S1 - S2|, separated by exactly one space.
Sample Input 1:
10 23 8 10 99 46 2333 46 1 666 555
Sample Output 1:
0 3611
Sample Input 2:
13 110 79 218 69 3721 100 29 135 2 6 13 5188 85
Sample Output 2:
1 9359
一道水题
#include <iostream> #include <cstdio> #include <algorithm> using namespace std; int a[100000]; int main() { int n; scanf("%d",&n); for(int i=0;i<n;i++) scanf("%d",&a[i]); sort(a,a+n); int sum1=0; for(int i=0;i<n/2;i++) sum1+=a[i]; int sum2=0; for(int i=n/2;i<n;i++) sum2+=a[i]; printf("%d ",n%2); printf("%d",sum2-sum1); return 0; }
相关文章推荐
- pat 1113. Integer Set Partition
- pat 甲1113. Integer Set Partition(排序水题)
- 【PAT】1113. Integer Set Partition
- PAT1113: Integer Set Partition
- PAT|1113. Integer Set Partition
- 1113. Integer Set Partition
- PAT--1113. Integer Set Partition
- Leetcode Q12 : Integer to Roman
- java报错:java.lang.Integer cannot be cast to java.lang.Long
- [LeetCode]Integer to Roman
- Java300StudyNote(12)-Java浮点数以及浮点数误差问题、BigInteger、BigDecimal、float与long谁更大
- 【LeetCode】12 & 13 - Integer to Roman & Roman to Integer
- JavaSE8基础 Class 向ArrayList<Integer>中添加Double类型变量
- [Leetcode] String to Integer (atoi)
- 数据库权限优化,权限设计BigInteger
- JavaSE----API之常用类(StringBuffer、Integer、Character)
- Integer.bitCount函数解释
- 【java.math.BigInteger】【转】常见问题
- [LeetCode]7.Reverse Integer ❤
- String to Integer (atoi)