Problem p02263 (C++) — buggy submission, verdict: Runtime Error

#include <algorithm>  //std::sort
#include <bitset>     //std::bitset
#include <chrono>     //std::chrono(C++11)
#include <cmath>      //abs,std::pow,sqrt,sin,cos,round,floor,ceil
#include <cstdlib>    //abs
#include <ctime>      //localtime_s
#include <fstream>    //std::ifstream,std::ofstream
#include <functional> //std::greater
#include <iomanip>    //std::setprecision,std::setw,std::setfill
#include <iostream>   //std::cout, std::cin
#include <numeric>    //std::accumulate
#include <queue>      //std::queue
#include <random>     //std::random(C++11)
#include <stack>      //std::stack
#include <string>     //std::string,std::to_string(C++11)
#include <valarray>   //std::valarray
#include <vector>     //std::vector

const static double de_PI = 3.14159265358979323846;
const static int de_MOD = 1000000007;
const static int de_MAX = 999999999;
const static int de_MIN = -999999999;

int main(void) {

  // std::ifstream in("123.txt");	std::cin.rdbuf(in.rdbuf());
  // std::ofstream ofs("456.csv");
  // std::chrono::system_clock::time_point t_st =
  // std::chrono::system_clock::now();

  std::string temp;
  int n1 = 0, n2 = 0;
  std::stack<int> A;

  while (std::cin >> temp) {
    switch (temp[0]) {
    case '+':
      n1 = A.top();
      A.pop();
      n2 = A.top();
      A.pop();
      A.push(n1 + n2);
      break;
    case '-':
      n1 = A.top();
      A.pop();
      n2 = A.top();
      A.pop();
      A.push(n2 - n1);
      break;
    case '*':
      n1 = A.top();
      A.pop();
      n2 = A.top();
      A.pop();
      A.push(n1 * n2);
      break;
    default:
      A.push(std::stoi(temp));
    }
  }
  std::cout << A.top() << std::endl;

  // std::chrono::system_clock::time_point t_ed =
  // std::chrono::system_clock::now(); std::cout <<
  // std::chrono::duration_cast<std::chrono::milliseconds>(t_ed - t_st).count()
  // << "ms" << std::endl;
}

Error: -11

Fixed submission:

#include <algorithm>  //std::sort
#include <bitset>     //std::bitset
#include <chrono>     //std::chrono(C++11)
#include <cmath>      //abs,std::pow,sqrt,sin,cos,round,floor,ceil
#include <cstdlib>    //abs
#include <ctime>      //localtime_s
#include <fstream>    //std::ifstream,std::ofstream
#include <functional> //std::greater
#include <iomanip>    //std::setprecision,std::setw,std::setfill
#include <iostream>   //std::cout, std::cin
#include <numeric>    //std::accumulate
#include <queue>      //std::queue
#include <random>     //std::random(C++11)
#include <stack>      //std::stack
#include <string>     //std::string,std::to_string(C++11)
#include <valarray>   //std::valarray
#include <vector>     //std::vector

const static double de_PI = 3.14159265358979323846;
const static int de_MOD = 1000000007;
const static int de_MAX = 999999999;
const static int de_MIN = -999999999;

int main(void) {

  std::ifstream in("123.txt");
  std::cin.rdbuf(in.rdbuf());
  // std::ofstream ofs("456.csv");
  // std::chrono::system_clock::time_point t_st =
  // std::chrono::system_clock::now();

  std::string temp;
  int n1 = 0, n2 = 0;
  std::stack<int> A;

  while (std::cin >> temp) {
    switch (temp[0]) {
    case '+':
      n1 = A.top();
      A.pop();
      n2 = A.top();
      A.pop();
      A.push(n1 + n2);
      break;
    case '-':
      n1 = A.top();
      A.pop();
      n2 = A.top();
      A.pop();
      A.push(n2 - n1);
      break;
    case '*':
      n1 = A.top();
      A.pop();
      n2 = A.top();
      A.pop();
      A.push(n1 * n2);
      break;
    default:
      A.push(std::stoi(temp));
    }
  }
  std::cout << A.top() << std::endl;

  // std::chrono::system_clock::time_point t_ed =
  // std::chrono::system_clock::now(); std::cout <<
  // std::chrono::duration_cast<std::chrono::milliseconds>(t_ed - t_st).count()
  // << "ms" << std::endl;
}