poj 3262 Protecting the Flowers

最新推荐文章于 2023-07-10 07:51:09 发布

fisty

最新推荐文章于 2023-07-10 07:51:09 发布

阅读量394

点赞数

本文链接：https://blog.csdn.net/u013008291/article/details/39737357

版权

简单题专栏收录该内容

13 篇文章 0 订阅

订阅专栏

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;

#define MAX_N 1000000

pair <int, int> arr[MAX_N];
pair <double, int> tmp[MAX_N];
int N;


int main(){
        scanf("%d", &N);
        long long  sum = 0,ans = 0;
        for(int i = 0;i < N; i++){
                scanf("%d%d", &arr[i].first, &arr[i].second);
                tmp[i].first = arr[i].first*1.0 / arr[i].second;
                tmp[i].second = i;
        }
        sort(tmp, tmp + N);
       
        for(int i = 0;i < N; i++){
                ans += sum * arr[tmp[i].second].second;
                sum += arr[tmp[i].second].first * 2; 
        }

        printf("%lld\n", ans);
        
        return 0;
}