PAT - 甲级 - 1113. Integer Set Partition (25) (排序)
来源:互联网 发布:开源数据展示平台 编辑:程序博客网 时间:2024/05/17 09:24
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:1023 8 10 99 46 2333 46 1 666 555Sample Output 1:
0 3611Sample Input 2:
13110 79 218 69 3721 100 29 135 2 6 13 5188 85Sample Output 2:
1 9359
题目大意:给定n个数字,把这n个数字分成2组,使得这2组的数字个数之差尽可能小的前提下,让2组数字的和之差最大。
很容易想到,2组数字个数之差不是0就是1,(n 是偶数和奇数的情况) 将较大的数放一组,较小的数一组,相减就是答案。
#include<cstdio>#include<algorithm>#define N 100001int n,sum1=0,sum2=0;int a[N];using namespace std;int main(){scanf("%d",&n);for(int i=0 ;i<n ;i++){scanf("%d",&a[i]);}sort(a,a+n);int x = n/2;for(int i=0 ;i<x ;i++){sum1+=a[i];}for(int i=x ;i<n ;i++){sum2+=a[i];}if(n%2==0)printf("0 ");else printf("1 ");printf("%d\n",sum2-sum1);return 0;}
- PAT - 甲级 - 1113. Integer Set Partition (25) (排序)
- 1113. Integer Set Partition (25) PAT 甲级
- PAT 甲级 1113. Integer Set Partition (25)
- 1113. Integer Set Partition (25)-PAT甲级真题
- pat 1113. Integer Set Partition (25)
- PAT--1113. Integer Set Partition
- pat 1113. Integer Set Partition
- PAT|1113. Integer Set Partition
- 【PAT】1113. Integer Set Partition
- pat 甲1113. Integer Set Partition(排序水题)
- solution Of Pat 1113. Integer Set Partition (25)
- 【PAT】【Advanced Level】1113. Integer Set Partition (25)
- PAT A1113. Integer Set Partition (25)
- PAT A1113 integer set partition (25)
- 1113. Integer Set Partition (25)
- 1113. Integer Set Partition (25)
- 1113. Integer Set Partition (25)
- 1113. Integer Set Partition (25)
- Vue.js中Directive知识
- ANSI C (5) —— 结构、联合、位字段、枚举
- CentOS7架设DNS服务器(Bind)
- Android webView详解
- dtd
- PAT - 甲级 - 1113. Integer Set Partition (25) (排序)
- 每次打开office2010都会出现正在配置,很烦?关掉它!
- 10分钟掌握Markdown语法,做一名有知识的程序员
- QWeb是odoo模板引擎
- PAT_乙级 1035 插入与归并
- WCF、WebAPI、WCFREST、WebService之间的区别
- VBS调用mswinsck.ocx
- 5.4更新 Dapper通用类新增方法:Oracle多表联查 获取集合 动态类型集合对象
- 在线重定义19G表,转化为组合分区表。应用无需停止。