codeforce好地方啊 Bear and Elections *

Codeforces Round #318

居然可以看测试数据，哪里没过一目了然，哈哈哈

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<map>
using namespace std;
#define MOD 1000000007
const int INF=0x3f3f3f3f;
const double eps=1e-5;
typedef long long ll;
#define cl(a) memset(a,0,sizeof(a))
#define ts printf("*****
");
const int MAXN=1005;
int n,m,tt;
struct Node
{
    int id,x;
    void in(int i)
    {
        scanf("%d",&x);
        id=i;
    }
    friend bool operator<(Node a,Node b)
    {
        if(a.x==b.x)    return a.id<b.id;
        else return a.x<b.x;
    }
}node[MAXN];
int main()
{
    int i,j,k,ca=1;
    #ifndef ONLINE_JUDGE
    freopen("1.in","r",stdin);
    #endif
    while(scanf("%d",&n)!=EOF)
    {
        priority_queue<Node> q;
        for(i=0;i<n;i++)
        {
            node[i].in(i);
            q.push(node[i]);
        }
        int tot=0;
        while(1)
        {
            Node now=q.top();
            q.pop();
            if(node[0].x+tot>now.x||now.id==0)
            {
                break;
            }
            now.x-=1;
            tot++;
            q.push(now);
        }
        printf("%d
",tot);
    }
}