Affiliate Disclosure: This post contains Amazon affiliate links. If you purchase through these links, eBlogarithm may earn a commission at no extra cost to you. Prices and availability are subject to change.
#include <bits/stdc++.h>
using namespace std;
set<int> s[100005];
int main()
{
int n,i,x;
cin>>n;
int m=0;
for(i=0;i<n;i++)
{
cin>>x;
s[x].insert(i);
m=max(m,x);
}
i=0;
long long int c=0,val=1,ans=0;
while(i<=m)
{
if(s[i].size()==0)
i++;
else
{
set<int>::iterator itr=s[i].lower_bound(c);
if(itr!=s[i].end())
{
c=*itr;
ans+=val;
s[i].erase(itr);
}
else
{
c=0;
val++;
}
}
}
cout<<ans<<endl;
return 0;
}
📦 Looking for Codeforces Round 424 Div Based Vk? Check the best deals on Amazon.
🛒 Shop Codeforces Round 424 Div Based Vk on Amazon
As an Amazon Associate, eBlogarithm earns from qualifying purchases. Prices and availability are subject to change.
, problem: (E) Cards Sorting Solution in C/C++. #include using namespace std;){kind=link}