解题思路:
注意事项:
参考代码:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
int n;
ll a[N];
int num[N] = {0};
ll sum[N] = {0};
int main()
{
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum[i] = sum[i-1] + a[i];
}
int m;
cin >> m;
ll sum1 = 0;
int left, right;
for (int i = 0; i < m; i++) {
cin >> left >> right;
sum1 += sum[right] - sum[left-1];
num[left]++;
num[right + 1]--;
}
for (int i = 1; i <= n; i++) {
num[i] += num[i-1];
}
sort(a + 1, a + n + 1);
sort(num + 1, num + n + 1);
ll sum2 = 0;
for (int i = 1; i <= n; i++) {
sum2 += a[i] * num[i];
}
cout << sum2 - sum1 << endl;
return 0;
}
0.0分
2 人评分
模拟计算器 (C语言代码)浏览:886 |
C二级辅导-公约公倍 (C语言代码)浏览:1508 |
C语言考试练习题_排列 (C语言代码)浏览:1317 |
C语言训练-计算一个整数N的阶乘 (C语言代码)浏览:933 |
C语言程序设计教程(第三版)课后习题4.9 (C语言代码)浏览:377 |
C语言程序设计教程(第三版)课后习题5.5 (C语言代码)浏览:559 |
C语言考试练习题_排列 (C语言代码)浏览:719 |
C语言训练-尼科彻斯定理 (C语言代码)浏览:466 |
WU-图形输出 (C++代码)浏览:802 |
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:470 |