Partitioning Sequences (std::partition)

Medium STL Algorithms

Solve in Playground →

Problem Statement

Write a C++ program using `std::partition` to rearrange elements so that all even numbers appear before odd numbers.

Input Format

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

Output Format

Print partitioned vector elements separated by a space (relative order within groups does not need to be strictly stable).

Constraints

1 <= N <= 1000

Sample Input

6
1 2 3 4 5 6

Sample Output

6 2 4 3 5 1

Explanation

Rearranges elements based on a predicate condition in-place.

Starter Code

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

int main() {
    int n;
    if (std::cin >> n) {
        std::vector<int> vec(n);
        for (int i = 0; i < n; i++) std::cin >> vec[i];
        
        // Write your std::partition logic here

    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →