The output for this piece of code is not what I expected :

#include <iostream>

using namespace std;

int main() {
  int n = 10;
  cout << n << " " << n++;
}

OUTPUT : 11 10

Is it because of the way iostream overloads bitwise shift operator or something else? ...

Problem :

Given a weighted directed graph with both negative and positive edges, Find a path from vertex 1 to n, in which minimum subpath weight(starting from vertex 1) is maximum.

I can't think of any graph algorithm that can help me solve this problem, so any suggestions are appreciated.

N<=500