Codeforces Round #169 (Div. 2)---C. Little Girl and Maximum Sum（简单贪心）

最新推荐文章于 2022-12-16 16:19:21 发布

原创

最新推荐文章于 2022-12-16 16:19:21 发布 · 1.2k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#贪心

本文介绍了一个关于数组查询的问题，其中目标是通过重新排列数组元素以最大化查询结果之和。输入包含数组元素和多个查询区间，输出是重新排序后的最大查询和。解决方案涉及统计每个位置元素出现的频率，并将最大值放在出现次数最多的位置。

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 space-separated integers ai (1 ≤ ai ≤ 2·105) — the array elements.

Each of the following q lines contai