Integer Set Partition (25)解题报告
2016-12-31 15:28
387 查看
先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
;
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;
}
#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
;
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;
}
相关文章推荐
- PAT (Advanced Level) Practise 1113 Integer Set Partition (25)
- 【PAT】【Advanced Level】1113. Integer Set Partition (25)
- 1113. Integer Set Partition (25) PAT 甲级
- 1113. Integer Set Partition (25)
- 1113. Integer Set Partition (25)[数学逻辑题]
- PAT (Advanced Level) Practise 1113 Integer Set Partition (25)
- PAT A1113 integer set partition (25)
- PAT - 甲级 - 1113. Integer Set Partition (25) (排序)
- solution Of Pat 1113. Integer Set Partition (25)
- 1113. Integer Set Partition (25)
- PAT_A 1113. Integer Set Partition (25)
- PAT (Advanced Level)1113. Integer Set Partition (25)
- PAT (Advanced Level) 1113. Integer Set Partition (25)
- pat 1113. Integer Set Partition (25)
- PAT 甲级 1113. Integer Set Partition (25)
- 1113. Integer Set Partition (25)
- [置顶] 刘汝佳《训练指南》动态规划::Beginner (25题)解题报告汇总
- 【LeetCode】Set Matrix Zeroes 解题报告
- PAT 解题报告 1013. Battle Over Cities (25)
- leetcode解题报告(25):Reverse Words in a String III