Envío 2395

Código

#include<bits/stdc++.h>
using namespace std;
#define optimizar_io ios_base::sync_with_stdio(0); cin.tie(0);
#define fore(i, a, b) for(int i = a; i < b; i++)
#define fori(i, a, b) for(int i = a; i <= b; i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define popb pop_back
#define mk make_pair
#define fi first
#define se second
#define endl '\n'
#define MAX 200
typedef long long int lli;
typedef long double ld;

int main() {
    int cases, n, tam, ii=1;
    cin >> cases;
    while(cases--){
        cin >> tam;
        vector<int> numbers;
        while(tam--){
            cin >> n;
            numbers.push_back(n);
        }

        int aux = 0;
        bool ban = 0;
        int asnwer[numbers.size()];
        for (int i=0;i<numbers.size();i++){
            ban = 0;
            for (int j=i+1;j<numbers.size();j++){
                if(numbers[j]>numbers[i]){
                    asnwer[i] = numbers[j];
                    ban = 1;
                    break;
                }
            }
            if(!ban) asnwer[i] = -1;
        }

        cout << "Case #" << (ii++) << ": ";
        for(int i=0;i<numbers.size();i++){
            if(i+1 == numbers.size())
                cout << asnwer[i] << endl;
            else
                cout << asnwer[i] << " ";
        }
    }
	return 0;
}