Submission #639751

#	Time	Username	Problem	Language	Result	Execution time	Memory
639751		Pietra	Karte (COCI18_karte)	C++14	12 / 120	178 ms	2476 KiB

karte

#include<bits/stdc++.h>
using namespace std ;
// o ideal eh começar decrescente
// o ideal eh o começo ter os certos
// se quiser mudar

const int maxn = 1e5 + 5 ;

int n, k, v[maxn], ct[maxn], used[maxn], seq[maxn] ;

// pga o menorr q satisfaz smp pros verdadeiros
// pros falos coloca os maiores mais a esq
int main(){

    cin >> n >> k ;

    vector<int> vec, vv ;

    for(int i = 0 ; i < n ; i++){
        int a ; cin >> a ;
        vec.push_back(a) ;
    }

    sort(vec.begin(), vec.end()) ; reverse(vec.begin(), vec.end()) ;
    //reverse(vec.begin(), vec.begin()+k) ;

    int ctr = 0 ;

    for(int i = 0 ; i < n ; i++){
        if(ctr >= vec[i]) continue ;
        else ctr++ ;
    }

    if(ctr != k){
        cout << "-1\n" ; exit(0) ;
    }

    for(int i = n-1 ; i >= 0 ; i--) cout << vec[i] << " " ;

}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 12
• Subtask 3: 0 / 12
• Subtask 4: 0 / 12
• Subtask 5: 0 / 12
• Subtask 6: 12 / 12
• Subtask 7: 0 / 12
• Subtask 8: 0 / 12
• Subtask 9: 0 / 12
• Subtask 10: 0 / 12