统计每个点被加的次数(区间加,差分+前缀和即可),然后贪心地,让被加次数多的尽量大。(CF以前还有这种水题的?(捂脸逃 )
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 200010
#define inf 0x3f3f3f3f
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*f;
}
int n,m,a[N],b[N];
ll ans=0;
int main(){
// freopen("a.in","r",stdin);
n=read();m=read();
for(int i=1;i<=n;++i) a[i]=read();
while(m--){
int x=read(),y=read();b[x]++;b[y+1]--;
}for(int i=1;i<=n;++i) b[i]+=b[i-1];
sort(a+1,a+n+1);sort(b+1,b+n+1);
for(int i=1;i<=n;++i) ans+=(ll)a[i]*b[i];
printf("%I64d\n",ans);
return 0;
}