题目连接：

http://www.codeforces.com/contest/655/problem/B

Description

It is a balmy spring afternoon, and Farmer John's n cows are ruminating about link-cut cacti in their stalls. The cows, labeled 1 through n, are arranged so that the i-th cow occupies the i-th stall from the left. However, Elsie, after realizing that she will forever live in the shadows beyond Bessie's limelight, has formed the Mischievous Mess Makers and is plotting to disrupt this beautiful pastoral rhythm. While Farmer John takes his k minute long nap, Elsie and the Mess Makers plan to repeatedly choose two distinct stalls and swap the cows occupying those stalls, making no more than one swap each minute.

Being the meticulous pranksters that they are, the Mischievous Mess Makers would like to know the maximum messiness attainable in the k minutes that they have. We denote as pi the label of the cow in the i-th stall. The messiness of an arrangement of cows is defined as the number of pairs (i, j) such that i < j and pi > pj.

Input

The first line of the input contains two integers n and k (1 ≤ n, k ≤ 100 000) — the number of cows and the length of Farmer John's nap, respectively.

Output

Output a single integer, the maximum messiness that the Mischievous Mess Makers can achieve by performing no more than k swaps.

Sample Input

5 2

Sample Output

10

Hint

题意

给你1到n的序列，然后你可以最多交换k次

让你使得逆序数最多，问你答案是多少

题解：

贪心，第一个数和最后一个数交换，第二个数和倒数第二个数交换，然后这样就好了

每次对答案的贡献是2*(n-i-i)+1

这个画画图就知道了。

代码

#include<bits/stdc++.h>
using namespace std;long long ans,n,k;
int main()
{cin>>n>>k;for(int i=1;i+i<=n&&i<=k;i++)ans+=2*(n-i-i)+1;cout<<ans<<endl;
}