牛客寒假算法基础集训营3（D 处女座的训练）基础贪心

https://ac.nowcoder.com/acm/contest/329/D

#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include<algorithm>
#include<iomanip>
#define SIS std::ios::sync_with_stdio(false)
#define ll long long
#define INF 0x3f3f3f3f
#define mod 998244353
const int MAXN = 1e9 + 7;
const double PI = 3.14159265358979;
using namespace std;
const int N = 1e6 + 5;
/*int gcd(int a,int b)
{
	return b==0?a:gcd(b,a%b);
}
ll _power(int a, int b)//计算a^b;
{
	int ans=1, res=a;
	while(b){
		if(b&1) ans=ans*res%mod;
		res=res*res%mod;
		b>>=1;
	}
	return ans%mod;
	*/
struct node {
	ll a, b;
}s[N];
bool cmp(node x,node y){
	return x.b*y.a > x.a*y.b;
}
int main() {
	int n;
	cin >> n;
	ll sum = 0;
	for (int i = 1; i <= n; i++) {
		cin >> s[i].a >> s[i].b;
		sum += s[i].b;
	}
	ll ans = 0;
	sort(s+1, s + n+1, cmp);
	for (int i = 1; i <= n; i++) {
		sum = sum - s[i].b;
		ans += s[i].a * sum;
	}
	cout << ans << endl;
	return 0;
}

注意排序是每分钟的疲倦值最大放前面