Submission #639746

#	Time	Username	Problem	Language	Result	Execution time	Memory
639746		Pietra	Karte (COCI18_karte)	C++14	0 / 120	175 ms	6840 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()) ;

    for(int i = n ; i >= n - k ; i--) v[i] = vec[i-1] ;

    for(int i = 1 ; i < n-k ; i++) vv.push_back(vec[i-1]) ;

    sort(vv.begin(), vv.end()) ;
    reverse(vv.begin(), vv.end()) ;

    for(int i = 1 ; i < n-k ; i++) v[i] = vv[i-1] ;

    bool ans = 1 ;

    int ctr = 0 ;

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

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

    for(int i = 1 ; i <= n ; i++) cout << v[i] << " " ;

}

Compilation message (stderr)

karte.cpp: In function 'int main()':
karte.cpp:35:10: warning: unused variable 'ans' [-Wunused-variable]
   35 |     bool ans = 1 ;
      |          ^~~

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