Codeforces Round #169 (Div. 2) C. Little Girl and Maximum Sum 差分问题

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

looooooogn

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

阅读量167

点赞数 1

本文链接：https://blog.csdn.net/qq_40273481/article/details/81087542

版权

这是一道关于数组查询的问题，要求找到一种重新排列数组元素的方法，使得在给定的查询范围内，数组元素之和达到最大。输入包括数组长度、查询数量及各个查询的范围，输出是最大查询和。可以通过差分数组来解决这个问题。

摘要由CSDN通过智能技术生成

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 cont