唔个人认为接近最优解了但是为什么才60%

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<unordered_map>
#define ll long long
#define si short int
#define pi 3.1415926
using namespace std;
const int N=3e5+9;
const ll INF=0xffffff;
ll n,ans,cnt; 
int main()
{
	cin>>n;
	while(n) {
		cnt++;
		if(cnt>n) {
			while(n) {
				ans+=cnt,n--; 
			} 
		}
		else ans+=cnt*cnt,n-=cnt;
	}
	cout<<ans;
}