The MAX

最新推荐文章于 2025-04-22 16:16:29 发布

原创最新推荐文章于 2025-04-22 16:16:29 发布 · 396 阅读

0 ·

CC 4.0 BY-SA版权

The MAX

Time Limit : 4000/2000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 58 Accepted Submission(s) : 26

Problem Description

Giving N integers, V1, V2,,,,Vn, you should find the biggest value of F.

Input

Each test case contains a single integer N (1<=N<=100). The next line contains N integers, meaning the value of V1, V2....Vn.(1<= Vi <=10^8).The input is terminated by a set starting with N = 0. This set should not be processed.

Output

For each test case, output the biggest value of F you can find on a line.

Sample Input

2
1 2
0

Sample Output

4017

就是将输入n个数的时候，有n-1个1与除最大的数值后与n-1个数相乘，加上2009-n+1乘以最大的数即可

#include<stdio.h>
#include<stdlib.h>
int main() {
    int a,j,t,h;
    while(scanf("%d",&t)&&t) {
        h=2009-t+1;
        long long q[t-1];
        for(int t1=0; t1<t; t1++) {
            scanf("%lld",&q[t1]);
        }
        int x;
        for(j=0; j<=t-2; j++) {
            for(int k=j+1; k<=t-1; k++) {
                if(q[j]>=q[k]) {
                    x=q[j];
                    q[j]=q[k];
                    q[k]=x;
                }
            }
        }
        long long s=q[t-1]*h;
        for(int k=0; k<=t-2; k++)
            s=s+q[k];
        printf("%lld\n",s);
    }

    return 0;
}
 
 
就是没看懂题目导致错误。认真审题