Weighted Event Scheduling

You are given a list of events, where each event is represented as an object with three properties:

• start: the start time of the event (an integer),
• end: the end time of the event (an integer), and
• value: the benefit value gained by attending the event (an integer).

Write a function that takes this list of events and returns the maximum total benefit you can achieve by selecting a subset of non-overlapping events. Two events are considered overlapping if one event starts before the other finishes.

Example:

Suppose you have the following events:

[
  { "start": 1, "end": 3, "value": 50 },
  { "start": 3, "end": 5, "value": 20 },
  { "start": 4, "end": 6, "value": 100 },
  { "start": 6, "end": 7, "value": 200 }
]

A possible optimal selection would yield a total benefit of 350.

Implement your solution in your preferred programming language. The problem should be solved with an appropriate algorithm to efficiently handle a potentially large list of events.