QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#645875#5076. Prof. Pang and AntsKevin5307ML 0ms3652kbC++231.1kb2024-10-16 20:18:142024-10-16 20:18:15

Judging History

你现在查看的是最新测评结果

  • [2024-10-16 20:18:15]
  • 评测
  • 测评结果:ML
  • 用时:0ms
  • 内存:3652kb
  • [2024-10-16 20:18:14]
  • 提交

answer

//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
ll a[100100];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--)
	{
		int n;
		ll m;
		cin>>n>>m;
		for(int i=1;i<=n;i++)
			cin>>a[i];
		sort(a+1,a+n+1);
		vector<ll> vec;
		for(int i=1;i<=m;i++)
		{
			int p=min_element(a+1,a+n+1)-a;
			vec.pb(++a[p]);
		}
		ll ans=0;
		for(int i=0;i<sz(vec);i++)
			ans=max(ans,vec[i]+vec[sz(vec)-i-1]);
		cout<<ans<<'\n';
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3652kb

input:

3
2 4
1 2
3 10
1 2 3
5 1
1 2 3 4 5

output:

6
9
4

result:

ok 3 number(s): "6 9 4"

Test #2:

score: -100
Memory Limit Exceeded

input:

1
1 100000000000000
1000000000

output:


result: