PTA甲级 1113 Integer Set Partition (25 point(s))

最新推荐文章于 2024-08-07 12:16:45 发布

Camilleferros

最新推荐文章于 2024-08-07 12:16:45 发布

阅读量180

点赞数

分类专栏： PTA甲级

本文链接：https://blog.csdn.net/huangpengyu123/article/details/114893848

版权

PTA甲级专栏收录该内容

117 篇文章 4 订阅

订阅专栏

强烈推荐,刷PTA的朋友都认识一下柳神–PTA解法大佬

本文由参考于柳神博客写成

柳神的CSDN博客,这个可以搜索文章

柳神的个人博客,这个没有广告,但是不能搜索

还有就是非常非常有用的算法笔记全名是

算法笔记  上级训练实战指南		//这本都是PTA的题解
算法笔记

PS 今天也要加油鸭

在这里插入图片描述

题目原文

Given a set of N (>1)

ositive 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

生词如下:

PS:这题太水了.水到无法呼吸. 但是就这样.题目我还是看不懂

虽然写出来了-但是因为这个水题啊.

disjoint 不相交

题目大意:

#include <iostream>
#include <map>
#include <cstdio>
#include <set>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
    int N;
    cin >> N;
    vector<int> Data(N);
    int n1=0, n2=0,sum1=0,sum2=0; 
    for (int i = 0; i < N; ++i) {
        int j = 0;
        scanf("%d", &j);
        Data[i] = j;
    }
    sort(Data.begin(), Data.end());
    n1 = N / 2;
    n2 = N - n1;                //大的那个
    printf("%d", n2 - n1);
    for (int i = 0; i < N; ++i) {
        if (i < n1) sum1 += Data[i];
        else    sum2 += Data[i];
    }
    printf(" %d", sum2 - sum1);
    return 0;
}