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-;
 typedef long long ll;
 #define cl(a) memset(a,0,sizeof(a))
 #define ts printf("*****\n");
 const int MAXN=;
 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=;
     #ifndef ONLINE_JUDGE
     freopen("1.in","r",stdin);
     #endif
     while(scanf("%d",&n)!=EOF)
     {
         priority_queue<Node> q;
         for(i=;i<n;i++)
         {
             node[i].in(i);
             q.push(node[i]);
         }
         int tot=;
         while()
         {
             Node now=q.top();
             q.pop();
             if(node[].x+tot>now.x||now.id==)
             {
                 break;
             }
             now.x-=;
             tot++;
             q.push(now);
         }
         printf("%d\n",tot);
     }
 }