codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

276C.md (1741B)


      1 Source: https://codeforces.com/problemset/problem/276/C
      2 
      3 C. Little Girl and Maximum Sum
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 The little girl loves the problems on array queries very much.
     22 
     23 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 $l_i$, $r_i$ $(1 \le l_i \le r_i \le n)$. You need to find for each query the sum of elements of the array with indexes from $l_i$ to $r_i$, inclusive.
     24 
     25 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.
     26 
     27 Input
     28 
     29 The first line contains two space-separated integers $n$ ($1 \le n \le 2\cdot10^5$) and $q$ ($1 \le q \le 2\cdot10^5$) — the number of elements in the array and the number of queries, correspondingly.
     30 
     31 The next line contains $n$ space-separated integers $a_i$ ($1 \le a_i \le 2\cdot10^5$) — the array elements.
     32 
     33 Each of the following $q$ lines contains two space-separated integers $l_i$ and $r_i$ ($1 \le l_i \le r_i \le n$) — the $i$-th query.
     34 
     35 Output
     36 
     37 In a single line print, a single integer — the maximum sum of query replies after the array elements are reordered.
     38 
     39 Please, do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams or the %I64d specifier.
     40 
     41 Examples
     42 
     43 Input
     44 
     45 ```
     46 3 3  
     47 5 3 2  
     48 1 2  
     49 2 3  
     50 1 3
     51 ```
     52 
     53 Output
     54 
     55 ```
     56 25
     57 ```
     58 
     59 Input
     60 
     61 ```
     62 5 3  
     63 5 2 4 1 3  
     64 1 5  
     65 2 3  
     66 2 3
     67 ```
     68 
     69 Output
     70 
     71 ```
     72 33
     73 ```