[PAT-A] 1113 Integer Set Partition

Java

测试点2、3超时

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(reader.readLine());
        long[] a = new long[n];

        String[] inputs = reader.readLine().split(" ");
        for (int i = 0; i < n; ++i) {
            a[i] = Long.parseLong(inputs[i]);
        }
        reader.close();

        Arrays.sort(a);

        int i, n1 = 0, n2 = 0;
        long sum1 = 0, sum2 = 0;
        for (i = 0; i < n / 2; ++i) {
            sum1 += a[i];
            n1++;
        }
        for (; i < n; ++i) {
            sum2 += a[i];
            n2++;
        }

        System.out.println(Math.abs(n1 - n2) + " " + Math.abs(sum1 - sum2));
    }
}

C++

#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>

using namespace std;

typedef long long ll;

const int N = 100010;

int n;
ll a[N];

int main() {
    scanf("%d", &n);
    for (int i = 0; i < n; ++i) scanf("%lld", &a[i]);

    sort(a, a + n);

    int i, n1 = 0, n2 = 0;
    ll sum1 = 0, sum2 = 0;
    for (i = 0; i < n / 2; ++i) {
        sum1 += a[i];
        n1++;
    }
    for (; i < n; ++i) {
        sum2 += a[i];
        n2++;
    }

    printf("%d %lld\n", abs(n1 - n2), llabs(sum1 - sum2));

    return 0;
}