zoukankan      html  css  js  c++  java
  • Stas and the Queue at the Buffet

    During a break in the buffet of the scientific lyceum of the Kingdom of Kremland, there was formed a queue of nn high school students numbered from 11 to nn. Initially, each student ii is on position ii. Each student ii is characterized by two numbers — aiai and bibi. Dissatisfaction of the person ii equals the product of aiai by the number of people standing to the left of his position, add the product bibi by the number of people standing to the right of his position. Formally, the dissatisfaction of the student ii, which is on the position jj, equals ai(j1)+bi(nj)ai⋅(j−1)+bi⋅(n−j).

    The director entrusted Stas with the task: rearrange the people in the queue so that minimize the total dissatisfaction.

    Although Stas is able to solve such problems, this was not given to him. He turned for help to you.

    Input

    The first line contains a single integer nn (1n1051≤n≤105) — the number of people in the queue.

    Each of the following nn lines contains two integers aiai and bibi (1ai,bi1081≤ai,bi≤108) — the characteristic of the student ii, initially on the position ii.

    Output

    Output one integer — minimum total dissatisfaction which can be achieved by rearranging people in the queue.

    Examples

    Input
    3
    4 2
    2 3
    6 1
    
    Output
    12
    Input
    4
    2 4
    3 3
    7 1
    2 3
    
    Output
    25
    Input
    10
    5 10
    12 4
    31 45
    20 55
    30 17
    29 30
    41 32
    7 1
    5 5
    3 15
    
    Output
    1423
    本题的题意大致为,n个同学,他有两个值,ai和bi,而他的不满意的程度是ai(j1)+bi(nj)ai⋅(j−1)+bi⋅(n−j).我们通过分解因式
    得到(ai-bi)j+bi*n-ai
    我们就可以通过一个数组吧ai-bi的值进行排序,大的结果乘以小的结果即可,接下来是代码
    #include<iostream>
    #include<cstdio>
    #include<algorithm>
    #include<cstring>
    using namespace std;
    #define ll long long 
    const int maxn = 200010;
    ll a[maxn], b[maxn];
    ll lazy[maxn];
    int main()
    {
        int t;
        cin >> t;
        ll sum = 0;
        ll ans = 0;
        for (int i = 0; i < t; i++)
        {
            scanf("%lld %lld", &a[i], &b[i]);
            sum += b[i] * t - a[i];
            lazy[i] = a[i] - b[i];
        }
        sort(lazy, lazy + t);
        for (int i = 1;i <= t;i++)
        {
            ans += lazy[t - i ] * i;
        }
        printf("%lld", ans + sum);
    
    }
  • 相关阅读:
    史上最全Html与CSS布局技巧
    Discuz! X的CSS加载机制
    关于input框只能输入纯数字问题
    对象的数据属性
    vue中将光标定位到Input上的问题
    端口占用问题解决方案
    el-button如何消除右边计数样式
    如何改变vscode的背景颜色
    为什么——要实例化对象?
    call()&apply()
  • 原文地址:https://www.cnblogs.com/csxaxx/p/10831347.html
Copyright © 2011-2022 走看看