/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 556.0 KiB
#2 Accepted 47ms 556.0 KiB
#3 Accepted 89ms 540.0 KiB
#4 Accepted 89ms 768.0 KiB
#5 Accepted 90ms 328.0 KiB
#6 Accepted 89ms 788.0 KiB
#7 Accepted 91ms 540.0 KiB
#8 Accepted 94ms 540.0 KiB
#9 Accepted 113ms 544.0 KiB
#10 Accepted 90ms 540.0 KiB
#11 Accepted 95ms 540.0 KiB
#12 Accepted 89ms 540.0 KiB
#13 Accepted 89ms 540.0 KiB
#14 Accepted 118ms 540.0 KiB
#15 Accepted 167ms 536.0 KiB
#16 Accepted 89ms 540.0 KiB
#17 Accepted 92ms 540.0 KiB
#18 Accepted 89ms 772.0 KiB
#19 Accepted 89ms 540.0 KiB
#20 Accepted 92ms 540.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define dbg(a,b,c,d) cerr<<a<<"  "<<b<<"  "<<c<<"  "<<d<<endl;
#define kill(a) {cout<<a<<endl;continue;}
#define KILL(a) {cout<<a<<endl;return 0;}
#define debug cerr<<"Error Found"<<endl;
#define mem(a,b) memset(a,b,sizeof(a))
#define lcm(a, b) (a/__gcd(a,b))*b
#define w(t) cin>>t;while(t--)
#define pi  2 * acos(0.0)
#define endl "\n"
int t, cs = 1;
const int mxn = 1e3 + 3, mod = 1e9 + 7;

int32_t main()
{
    //fast;
   w(t)
   {
       int n;
       cin >> n;
       int64_t sum = 0;
       for(int i = 0, a; i < n; i++)cin >> a, sum += a;
       int64_t mex = 0;
       while(1LL * mex * (mex + 1) / 2 <= sum)mex++;
       cout << mex << endl;
   }


}

Information

Submit By
Type
Submission
Problem
P1114 Maximize the MEX
Contest
Brain Booster #7
Language
C++17 (G++ 13.2.0)
Submit At
2024-11-05 15:11:36
Judged At
2024-11-05 15:11:36
Judged By
Score
100
Total Time
167ms
Peak Memory
788.0 KiB