Reference Practice

Medium References PRO

🔒 Login to Unlock

Problem Statement

Write a C++ program implementing a utility function that takes a vector by reference and sorts its elements in-place.

Input Format

First line: N. Second line: N space-separated integers.

Output Format

Print sorted vector elements separated by a space.

Constraints

1 <= N <= 1000

Sample Input

5
40 10 50 30 20

Sample Output

10 20 30 40 50

Explanation

Passing containers by reference avoids expensive copies when sorting large data structures.

Starter Code

#include <iostream>
#include <vector>
#include <algorithm>

void sortVector(std::vector<int> &vec) {
    std::sort(vec.begin(), vec.end());
}

int main() {
    int n;
    if (std::cin >> n) {
        std::vector<int> vec(n);
        for (int i = 0; i < n; i++) std::cin >> vec[i];
        sortVector(vec);
        for (size_t i = 0; i < vec.size(); i++) {
            std::cout << vec[i];
            if (i < vec.size() - 1) std::cout << " ";
        }
        std::cout << "n";
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock