zoukankan      html  css  js  c++  java
  • CodeForces 432A Choosing Teams(水)

    Description

    The Saratov State University Olympiad Programmers Training Center (SSU OPTC) has n students. For each student you know the number of times he/she has participated in the ACM ICPC world programming championship. According to the ACM ICPC rules, each person can participate in the world championship at most 5 times.

    The head of the SSU OPTC is recently gathering teams to participate in the world championship. Each team must consist of exactly three people, at that, any person cannot be a member of two or more teams. What maximum number of teams can the head make if he wants each team to participate in the world championship with the same members at least k times?

    Input

    The first line contains two integers, n and k(1 ≤ n ≤ 2000; 1 ≤ k ≤ 5). The next line contains n integers: y1, y2, ..., yn(0 ≤ yi ≤ 5), where yi shows the number of times the i-th person participated in the ACM ICPC world championship.

    Output

    Print a single number — the answer to the problem.

    Sample Input

    Input
    5 2
    0 4 5 1 0
    Output
    1
    Input
    6 4
    0 1 2 3 4 5
    Output
    0
    Input
    6 5
    0 0 0 0 0 0
    Output
    2

    Hint

    In the first sample only one team could be made: the first, the fourth and the fifth participants.

    In the second sample no teams could be created.

    In the third sample two teams could be created. Any partition into two teams fits.

    #include<cstdio>
    #include<cstring>
    #include<iostream>
    #include<algorithm>
    using namespace std;
    int a[2000+10];
    int main()
    {
        int i,j,n,add,ans;
        while(scanf("%d%d",&n,&add)!=EOF)
        {
            if(add>5) {printf("0
    ");continue;}
            ans=0;
            for(i=0;i<n;i++)
            {
                scanf("%d",&a[i]);
                a[i]+=add;
            }
            sort(a,a+n);
            for(i=0;i<n;i++)
            {
                if(a[i]<=5) ans++;
                else break;
            }
            printf("%d
    ",ans/3);
        }
        return 0;
    }
    View Code
  • 相关阅读:
    api示例
    Windows+Ubuntu文件互传
    UI
    事件
    插件开发入门
    文摘
    刘海屏适配
    APT
    热修复
    进程保活
  • 原文地址:https://www.cnblogs.com/sola1994/p/4151989.html
Copyright © 2011-2022 走看看