zoukankan      html  css  js  c++  java
  • POJ3663

    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 (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

    代码
    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #define maxn 20020
    
    using namespace std;
    
    int num[maxn];
    int n,m;
    
    int main()
    {
        while(~scanf("%d%d",&n,&m))
        {
            for(int i=0;i<n;i++)
            {
                scanf("%d",&num[i]);
            }
            sort(num,num+n);
            int ans = 0;
            for(int i=0;i<n;i++)
            {
                int temp=upper_bound(num,num+i,m-num[i]) - num;
                ans+=temp;
            }
            cout <<ans<<endl;
        }
        return 0;
    }


  • 相关阅读:
    浅谈动态开点线段树
    详解二叉查找树(BST)
    数组的随机打乱
    浅谈迭代加深搜索
    浅谈传递闭包问题
    详解权值线段树
    算法竞赛中桶的概念与应用
    NKOJ 1353 图形面积
    并查集 & 最小生成树详细讲解
    【线段树基础】NKOJ 1321 数列操作
  • 原文地址:https://www.cnblogs.com/--lr/p/6716151.html
Copyright © 2011-2022 走看看