Language: C++

#include <cstdio>
#include <iostream>
using namespace std;

static const int MAX_NUM = 100000;

int PartitionSort(pair<int, char> elem[], int start, int end)
{
    int i;
    int target;
    int left;

    left = start - 1;
    target = elem#include <cstdio>
#include <iostream>
using namespace std;

static const int MAX_NUM = 100000;

int PartitionSort(pair<int, char> elem[], int start, int end)
{
    int i;
    int target;
    int left;

    left = start - 1;
    target = elem[end-1].first;

    for (i = start; i < end - 1; i++) {
        if (target >= elem[i].first) {
            ++left;
            swap(elem[left], elem[i]);
        }
    }
    ++left;
    swap(elem[left], elem[end-1]);

    return left;
}


void QuickSort(pair<int, char> elem[], int start, int end)
{
    int mid;

    mid = PartitionSort(elem, start, end);

    if (start < mid - 1) {
        QuickSort(elem, start, mid);
    }
    if (mid < end - 1) {
        QuickSort(elem, mid, end);
    }

    return;
}

int main(void)
{
    int i, j;
    char c[7];
    int num;
    pair<int, char> elem[MAX_NUM];

    scanf("%d", &num);
    for (i = 0; i < num; i++) {
        scanf("%s %d", &c, &j);
        elem[i].first  = j;
        elem[i].second = c[0];
    }

    QuickSort(elem, 0, num);

    for (i = 0; i < num; i++) {
        printf("%c %d\n", elem[i].second, elem[i].first);
    }

    return 0;
}

[end-1].first;

    for (i = start; i < end - 1; i++) {
        if (target >= elem[i].first) {
            ++left;
            swap(elem[left], elem[i]);
        }
    }
    ++left;
    swap(elem[left], elem[end-1]);

    return left;
}


void QuickSort(pair<int, char> elem[], int start, int end)
{
    int mid;

    mid = PartitionSort(elem, start, end);

    if (start < mid - 1) {
        QuickSort(elem, start, mid);
    }
    if (mid < end - 1) {
        QuickSort(elem, mid, end);
    }

    return;
}

int main(void)
{
    int i, j;
    char c[7];
    int num;
    pair<int, char> elem[MAX_NUM];

    scanf("%d", &num);
    for (i = 0; i < num; i++) {
        scanf("%s %d", &c, &j);
        elem[i].first  = j;
        elem[i].second = c[0];
    }

    QuickSort(elem, 0, num);

    for (i = 0; i < num; i++) {
        printf("%d %c\n", elem[i].first, elem[i].second);
    }

    return 0;
}

Compiler output:
a.cc:14:18: error: stray '#' in program
   14 |     target = elem#include <cstdio>
      |                  ^
a.cc: In function 'int PartitionSort(std::pair<int, char>*, int, int)':
a.cc:14:14: error: invalid conversion from 'std::pair<int, char>*' to 'int' [-fpermissive]
   14 |     target = elem#include <cstdio>
      |              ^~~~
      |              |
      |              std::pair<int, char>*
a.cc:14:18: error: expected ';' before 'include'
   14 |     target = elem#include <cstdio>
      |                  ^~~~~~~~
      |                  ;
a.cc:21:1: error: a function-definition is not allowed here before '{' token
   21 | {
      | ^
a.cc:43:1: error: a function-definition is not allowed here before '{' token
   43 | {
      | ^
a.cc:59:1: error: a function-definition is not allowed here before '{' token
   59 | {
      | ^
a.cc:81:5: error: expected ',' before '-' token
   81 | [end-1].first;
      |     ^
      |     ,
a.cc:81:5: error: expected identifier before '-' token
a.cc: In lambda function:
a.cc:81:8: error: expected '{' before '.' token
   81 | [end-1].first;
      |        ^
a.cc: In function 'int PartitionSort(std::pair<int, char>*, int, int)':
a.cc:81:9: error: 'struct PartitionSort(std::pair<int, char>*, int, int)::<lambda()>' has no member named 'first'
   81 | [end-1].first;
      |         ^~~~~