Integer Set Partition (25)解题报告
来源:互联网 发布:沈阳搜索引擎优化排名 编辑:程序博客网 时间:2024/06/05 10:58
先sort,然后前n/2个元素和其余元素即为所求。
#include <cstdio> #include <cstdlib> #include <algorithm> using namespace std; int main(void) { int n, *arr, i, pivot, left , right; scanf("%d", &n); arr = new int[n]; for (i = 0; i < n; i++) { scanf("%d", arr + i); } sort(arr, arr + n); pivot = n / 2; int n_n, s_s; n_n = n - pivot * 2; int sum1 = 0, sum2 = 0; for (i = 0; i < pivot; i++) { sum1 += arr[i]; } for (i = pivot; i < n; i++) { sum2 += arr[i]; } printf("%d %d\n", n_n, sum2 - sum1); delete[] arr; return 0; }
0 0
- Integer Set Partition (25)解题报告
- 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)
- 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)
- PAT_A 1113. Integer Set Partition (25)
- pat 1113. Integer Set Partition (25)
- 1113. Integer Set Partition (25) PAT 甲级
- PAT A1113. Integer Set Partition (25)
- PAT A1113 integer set partition (25)
- (精)tomcat 源码学习
- 定义了Shape,但是在LinearLayout中却显示不出来为什么啊?
- POI和JXI的区别
- 递归实现字符串逆置
- 摄像头权限选择的诡异问题!!!
- Integer Set Partition (25)解题报告
- 聊聊PC端页面适配
- Java内部类
- 使用Jedis操作Redis数据库
- 中国海军护航编队驶过新加坡、马六甲海峡
- org.springframework.beans.factory.BeanDefinitionStoreException: IOException parsing XML document fro
- FZU1054 之 阅读顺序
- absolute
- HTTP协议的简要内容