85D - Sum of Medians - CodeForces Solution


binary search brute force data structures implementation *2300

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
#define pos lower_bound(v.begin(),v.end(),x)
using namespace std;
int n,x;
vector<int> v;
int main() {
cin>>n;
while(n--){
string s;
cin>>s;
if(s[0]=='s'){
long long r=0;
for(int i=2;i<v.size();i+=5)r+=v[i];
cout<<r<<endl;
}
else{
cin>>x;
if(s[0]=='a')v.insert(pos,x);
else v.erase(pos);
}
}
return 0;
}


Comments

Submit
0 Comments
More Questions

807A - Is it rated
1096A - Find Divisible
1430C - Numbers on Whiteboard
1697B - Promo
208D - Prizes Prizes more Prizes
659A - Round House
1492C - Maximum width
171B - Star
1512B - Almost Rectangle
831B - Keyboard Layouts
814A - An abandoned sentiment from past
268C - Beautiful Sets of Points
1391C - Cyclic Permutations
11A - Increasing Sequence
1406A - Subset Mex
1365F - Swaps Again
50B - Choosing Symbol Pairs
1719A - Chip Game
454B - Little Pony and Sort by Shift
1152A - Neko Finds Grapes
1719B - Mathematical Circus
1719C - Fighting Tournament
1642A - Hard Way
285C - Building Permutation
1719E - Fibonacci Strings
1696C - Fishingprince Plays With Array
1085A - Right-Left Cipher
1508B - Almost Sorted
1690C - Restoring the Duration of Tasks
1055A - Metro