zoukankan      html  css  js  c++  java
  • Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2) A. Bear and Elections 优先队列

                                                    A. Bear and Elections
                                                                                                                                                                               time limit per test 
    1 second
                                                                                         memory limit per test 
    256 megabytes
     

    Limak is a grizzly bear who desires power and adoration. He wants to win in upcoming elections and rule over the Bearland.

    There are n candidates, including Limak. We know how many citizens are going to vote for each candidate. Now i-th candidate would get ai votes. Limak is candidate number 1. To win in elections, he must get strictly more votes than any other candidate.

    Victory is more important than everything else so Limak decided to cheat. He will steal votes from his opponents by bribing some citizens. To bribe a citizen, Limak must give him or her one candy - citizens are bears and bears like candies. Limak doesn't have many candies and wonders - how many citizens does he have to bribe?

    Input

    The first line contains single integer n (2 ≤ n ≤ 100) - number of candidates.

    The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 1000) - number of votes for each candidate. Limak is candidate number 1.

    Note that after bribing number of votes for some candidate might be zero or might be greater than 1000.

    Output

    Print the minimum number of citizens Limak must bribe to have strictly more votes than any other candidate.

    Sample test(s)
    input
    5
    5 1 11 2 8
    output
    4
    input
    4
    1 8 8 8
    output
    6
    input
    2
    7 6
    output
    0
    Note

    In the first sample Limak has 5 votes. One of the ways to achieve victory is to bribe 4 citizens who want to vote for the third candidate. Then numbers of votes would be 9, 1, 7, 2, 8 (Limak would have 9 votes). Alternatively, Limak could steal only 3 votes from the third candidate and 1 vote from the second candidate to get situation 9, 0, 8, 2, 8.

    In the second sample Limak will steal 2 votes from each candidate. Situation will be 7, 6, 6, 6.

    In the third sample Limak is a winner without bribing any citizen.

    题解:优先队列不多说

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<string>
    #include<algorithm>
    #include<queue>
    #include<cmath>
    #include<map>
    using namespace std ;
    typedef long long ll;
    #define inf 100000
    inline ll read()
    {
        ll x=0,f=1;char ch=getchar();
        while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
        while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
        return x*f;
    }
    //******************************************************************
    struct ss
    {
        int x,index;
        friend bool operator < (ss a, ss b)
        {
            return a.x<b.x;
        }
    };
    priority_queue<ss >q;
    int main()
    {
        int n,x;
        int sum=0;
        int y[1001];
        scanf("%d",&n);
        scanf("%d",&x);ss k,kk;
        for(int i=0;i<n-1;i++)
        {
            scanf("%d",&y[i]);
            if(y[i]>=x)
            {
                k.x=y[i];
                k.index=i+2;
                q.push(k);
            }
        }
        k.x=x;
        k.index=1;
        q.push(k);
        int ans=0;
        while(1)
        {
            k=q.top();
            if(k.index==1)break;
            q.pop();
            kk.x=k.x-1;
            kk.index=k.index;
            q.push(kk);
            x++;
            kk.x=x;
            kk.index=1;
            q.push(kk);
            ans++;
        }
        cout<<ans<<endl;
        return 0;
    }
    代码
  • 相关阅读:
    单机安装nginx
    单机安装hdfs
    单机安装postgresql
    cookie和session
    zookeeper的学习笔记
    java的反射和代理
    spring boot配置404 和 500错误页面跳转
    react + ant Upload前端解析excel文件后时间解析为数字转化回日期格式
    Chrome浏览器手动添加Cookie
    实现table列拖拽插件(colResizable)
  • 原文地址:https://www.cnblogs.com/zxhl/p/4770427.html
Copyright © 2011-2022 走看看