codeforces 276c Little Girl and Maximum Sum

最新推荐文章于 2024-04-10 17:45:59 发布

原创

最新推荐文章于 2024-04-10 17:45:59 发布 · 356 阅读

0 ·

CC 4.0 BY-SA版权

该博客主要解析Codeforces上的276C问题，题目要求在回答数组查询时，通过重新排列数组元素以最大化所有查询的和。博客内容包括输入输出格式说明，以及利用贪心策略解决此问题的方法。

http://www.elijahqi.win/archives/1184
The little girl loves the problems on array queries very much.

One day she came across a rather well-known problem: you’ve got an array of n elements (the elements of the array are indexed starting from 1); also, there are q queries, each one is defined by a pair of integers li, ri (1 ≤ li ≤ ri ≤ n). You need to find for each query the sum of elements of the array with indexes from li to ri, inclusive.

The little girl found the problem rather boring. She decided to reorder the array elements before replying to the queries in a way that makes the sum of query replies maximum possible. Your task is to find the value of this maximum sum.

Input
The first line contains two space-separated integers n (1 ≤ n ≤ 2·105) and q (1 ≤ q ≤ 2·105) — the number of elements in the array and the number of queries, correspondingly.

The next line contains n s