ZOJ-2488 Rotten Ropes

来源:互联网 发布:对象数组初始化 编辑:程序博客网 时间:2024/05/20 04:14

对每个绳子(承受力n)找出比它承受力大的绳子的个数m,则棍子重量 = n * m, 求出最大值即可.

#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#include <vector>#include <climits>using namespace std;int num[1005];int main(){   // freopen("in.txt", "r", stdin);    int t;    cin >> t;    while(t--)    {        int n;        cin >> n;        for(int i = 0; i < n; i++)            cin >> num[i];        sort(num, num+n);        int maxs = 0;        for(int i = 0; i < n; i++)        {            maxs = max(maxs, (n-i)*num[i]);        }        cout << maxs << endl;    }    return 0;}
0 0
原创粉丝点击