Accepted
Code
#include<bits/stdc++.h>
using namespace std;
const long long M=2e5+10,MOD=998244353;
typedef long long ll;
#define debug(x) cout<<x<<endl
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int t=1;
cin>>t;
while(t--){
int n;
cin>>n;
ll sum=0;
for(int i=1;i<=n;i++){
ll a;
cin>>a;
sum+=a;
}
ll ans=1;
ll l=1,r=1e9;
while(l<=r){
ll mid=l+(r-l)/2;
ll d= mid*(mid+1)/2;
if(d<=sum){
ans=mid+1;
l=mid+1;
}
else{
r=mid-1;
}
}
cout<<ans<<"\n";
}
return 0;
}
Information
- Submit By
- Type
- Submission
- Problem
- P1114 Maximize the MEX
- Language
- C++17 (G++ 13.2.0)
- Submit At
- 2024-11-12 18:34:13
- Judged At
- 2024-11-12 18:34:13
- Judged By
- Score
- 100
- Total Time
- 22ms
- Peak Memory
- 800.0 KiB