oj.uz

Submission #486722

# Submission time Handle Problem Language Result Execution time Memory
486722 2021-11-12T13:38:30 Z perchuts Karte (COCI18_karte) C++17
0 / 120
 152 ms 6404 KB 
#include <bits/stdc++.h>
#define maxn (int)(1e5+51)
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define endl '\n'
#define ll long long
#define ull unsigned long long
#define ii pair<int,int>
#define iii tuple<int,int,int>
#define inf (int)(2e9+1)
#define mod (int)(1e9+7)

using namespace std;
int v[5*maxn],ans[5*maxn];
set<int>cards;
int main() {
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int n,k;
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        int x;
        cin>>x;
        v[x]++;
        cards.insert(x);
    }
    for(int i=0;i<k;i++){
        set<int>::iterator it=cards.lower_bound(i+1);
        if(it==cards.end()){
            cout<<"-1"<<endl;
            return 0;
        }else{
            v[*it]--;
            ans[i]=*it;
            if(v[*it]==0){
                cards.erase(*it);
            }
        }       
    }
    int ind=k;
    for(int i=0;i<=n;i++){
        while(v[i]){
            ans[ind++]=i;
            v[i]--;
        }
    }
    reverse(ans,ans+n);
    for(int i=0;i<n;i++)
        cout<<ans[i]<<" ";

}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 2440 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 55 ms 3528 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 152 ms 6404 KB Output isn't correct
2 Halted 0 ms 0 KB -