50分求解
查看原帖
50分求解
1696493
Oberon_owl楼主2025/7/29 20:43

#3,#4,#7,#8,#10WA

CODE:CODE:

#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll a[114514];
ll ans=0,loss=0;
int main(){
	ll n,m,p,maxq;
	cin>>n>>m;
	for(ll i=1;i<=m;i++){
		cin>>a[i];
	}
	for(ll j=1;j<=m;j++)
		p=a[j];
		loss=0;
		for(ll r=1;r<=m;r++)
			if(a[r]>=p) loss++;  
            if(loss>=n) loss=n;  
            if(p*loss>maxq) maxq=p*loss;ans=p;
        cout<<ans<<" "<<maxq;
    return 0;
} 
2025/7/29 20:43
加载中...