Submission #1177692

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define Nmax 100000

int main(){
    int n,a[Nmax];
    cin>>n;
    priority_queue<int, vector<int>, greater<int> > q;
    for(int i=0;i<n;i++){
        cin>>a[i];
        q.push(a[i]);
    }
    for(int i=0;!q.empty();i++){
        int top=q.top();
        bool flag=false;
        for(int j=0;j<n;j++)
            if(a[j]==top&&a[j]>i){
                a[j]=i;
                flag=true;
            }
        if(!flag) i--;
        q.pop();
    }
    for(int i=0;i<n;i++){
        cout<<a[i]<<endl;
    }

}

Submission Info

Judge Result