#include <cstdlib>
#include <iostream>
#include <string>
#include <sstream>
#include <cstring>

using namespace std;

int main(){
    char buffer[80];

    cin.getline(buffer,80,'$');

    char* name[4];

    name[0] = buffer;

    int count = 0;

    for (char* p = buffer; *p != '\0'; p++)
        if (*p == '\n') {
             *p = '\0';
             name[++count] = p + 1;
         }

    cout << "names \n";

    for (int i = 0; i < count; i++)
        cout << name[i] << endl;
} 

#include <algorithm>  // std::sort
#include <iostream>   // std::cin, std::cout
#include <string>     // std::string
#include <vector>     // std::vector

int main()
{
  std::vector <std::string> names;
  {
    std::cout << "Enter some names, one per line.\n"
                 "Press Enter twice to finish.\n"
                 "> ";
    std::string name;
    while (getline( std::cin, name ))
    {
      if (name.empty()) break;
      names.push_back( name );
      std::cout << "> ";
    }
  }
  
  std::sort( names.begin(), names.end() );
  
  std::cout << "Here are the names you entered, in sorted order:\n";
  for (const auto & name : names)
    std::cout << name << "\n";
}

#ifdef __STDC_ALLOC_LIB__
#define __STDC_WANT_LIB_EXT2__ 1
#else
#define _POSIX_C_SOURCE 200809L
#endif

#include <stdio.h>   // printf, fflush, fgets, ...
#include <stdlib.h>  // qsort
#include <string.h>  // strchr, strdup, strcmp, ...


// Since this is C, we need some helper functions:


void scan_to_eol( FILE * f )
{
  int c;
  do c = getc( f );
  while ((c != EOF) && (c != '\n'));
}


int getline( char * s, int size_of_s, FILE * f )
// Read an entire line of text, discarding characters that don't fit in s
// Returns 1 on success, 0 on failure
{
  if (!fgets( s, size_of_s, f )) return 0;
  char * p = strchr( s, '\n' );
  if (p) *p = '\0';
  else scan_to_eol( f );
  return 1;
}


int pstrcmp( const void * a, const void * b )
{
  return strcmp( *(const char **)a, *(const char **)b );
}


int main( void )
{
  #define MAX_NAME_COUNT 1000
  char * names[ MAX_NAME_COUNT ];
  unsigned name_count = 0;
  {
    printf( "Enter some names, one per line.\n"
            "Press Enter twice to finish.\n"
            "> " );
    fflush( stdout );
    char name[ 100 ];
    while (name_count < MAX_NAME_COUNT)
    {
      if (!getline( name, sizeof(name), stdin )) break;
      if (!*name) break;
      names[ name_count++ ] = strdup( name );
      printf( "> " );
      fflush( stdout );
    }
  }
  
  qsort( names, name_count, sizeof(names[0]), pstrcmp );
  
  puts( "Here are the names you entered, in sorted order:" );
  for (unsigned n = 0;  n < name_count;  n++)
    puts( names[ n ] );
  
  return 0;
}

#include <algorithm>  // std::sort, std::copy
#include <iostream>   // std::cin, std::cout
#include <string>     // std::string
#include <vector>     // std::vector
#include <iterator>   // std::ostream_iterator

int main() {
	std::vector <std::string> names;

	std::cout << "Enter some names, one per line.\nPress Enter twice to finish.\n";

	for (std::string name; std::cout << "< " && getline(std::cin, name) && !name.empty(); names.emplace_back(std::move(name)));
	std::ranges::sort(names);

	std::cout << "Here are the names you entered, in sorted ascending order:\n";
	std::ranges::copy(names, std::ostream_iterator<std::string>(std::cout, "\n"));
}