POJ3663

最新推荐文章于 2021-02-22 05:56:31 发布

Aaronand

最新推荐文章于 2021-02-22 05:56:31 发布

阅读量462

点赞数

分类专栏： POJ 文章标签： poj

本文链接：https://blog.csdn.net/Aaronand/article/details/53404558

版权

POJ 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

1.题面

Description

It’s Halloween! Farmer John is taking the cows to a costume party, but unfortunately he only has one costume. The costume fits precisely two cows with a length of S (1 ≤ S ≤ 1,000,000). FJ has N cows (2 ≤ N ≤ 20,000) conveniently numbered 1..N; cow i has length Li (1 ≤ Li ≤ 1,000,000). Two cows can fit into the costume if the sum of their lengths is no greater than the length of the costume. FJ wants to know how many pairs of two distinct cows will fit into the costume.

Input

Line 1: Two space-separated integers: N and S
Lines 2..N+1: Line i+1 contains a single integer: Li

Output

Line 1: A single integer representing the number of pairs of cows FJ can choose. Note that the order of the two cows does not matter.

Sample Input

4 6
3
5
2
1
Sample Output

4

2.思路

先将数组排序
枚举i，利用upper_bound()计算出a[i]的配对个数，累计为cnt
所得个数被重复计算2次，答案除2

3.代码

#include <cstdio>
#include <algorithm>

using namespace std;

int main() {
    int s, n;
    int a[20000 + 5];
    while (scanf("%d %d", &n, &s) != EOF) {
        int cnt = 0;
        for (int i = 0; i < n; i++)
            scanf("%d", &a[i]);
        sort(a, a + n);
        for (int i = 0; i < n; i++){
            int temp = upper_bound(a, a + n, s - a[i])-a;
            if(a[temp-1]>=a[i]) temp--;
            cnt += temp;
        }
        cnt /=2;
        printf("%d\n", cnt);
    }
}