1113. Integer Set Partition (25)
来源:互联网 发布:没u盘怎么装windows 编辑:程序博客网 时间:2024/06/05 07:10
题目:
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:
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<cstdio>#include<vector>#include<algorithm>using namespace std;int main(){ int n,temp,sum=0,halfsum=0; scanf("%d",&n); vector<int> vec; for(int i=0;i<n;i++){ scanf("%d",&temp); sum+=temp; vec.push_back(temp); } sort(vec.begin(),vec.end()); for(int i=0;i<n/2;i++){ halfsum+=vec[i]; } printf("%d %d",n%2,sum-2*halfsum); return 0;}
- 1113. Integer Set Partition (25)
- 1113. Integer Set Partition (25)
- 1113. Integer Set Partition (25)
- 1113. Integer Set Partition (25)
- 1113. Integer Set Partition (25)
- 1113. Integer Set Partition (25)
- 1113. Integer Set Partition (25)
- 1113. Integer Set Partition (25)
- 1113. Integer Set Partition (25)
- 1113. Integer Set Partition (25)
- 1113. Integer Set Partition (25)
- 1113. Integer Set Partition
- 1113. Integer Set Partition
- PAT_A 1113. Integer Set Partition (25)
- pat 1113. Integer Set Partition (25)
- 1113. Integer Set Partition (25) PAT 甲级
- PAT 甲级 1113. Integer Set Partition (25)
- PAT--1113. Integer Set Partition
- Oc 二维码的生成
- 转载MySQL函数
- 设计模式之抽象工厂模式
- 完全背包
- 安装ruby遇到Error running '__rvm_make -j 1'错误解决办法
- 1113. Integer Set Partition (25)
- 使用sklearn做单机特征工程
- hdu1010 Tempter of the Bone
- Oc 二维码的扫描-ZBar与生成
- 从无到有环境配置(linux_ubuntu)
- 报名 | PHM竞赛史上首个中国本土冠军团队经验分享
- 看看人家程序员是怎么表白的 !(附教程~)
- 51nod 1635 第K个幸运排列
- AngularJs_路由