AcWing 5132. 奶牛照相
原题链接
中等
作者:
Suzukie
,
2023-08-06 11:52:13
,
所有人可见
,
阅读 95
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
const int N = 2e5 + 10;
typedef pair<int,int> PII;
PII milk[N];
int s,hn[N];
int main()
{
int n;
cin >> n;
for(int i = 1;i <= n;i ++)
{
int w, h;
cin >> w >> h;
milk[i] = {h,w};
s += w;
hn[i] = h;
}
sort(hn+1,hn+n+1);
for(int i = 1;i <= n;i ++)
{
int ww = s - milk[i].second;
int hw;
if(milk[i].first == hn[n])hw = hn[n-1];
else hw = hn[n];
printf("%lld ",ww * hw);
}
}