|
||||||||||
InversionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 13241 Accepted Submission(s): 4501 Problem Description bobo has a sequence a1,a2,¡,an. He is allowed to swap two adjacent numbers for no more than k times. Find the minimum number of inversions after his swaps. Note: The number of inversions is the number of pair (i,j) where 1¡Üi<j¡Ün and ai>aj. Input The input consists of several tests. For each tests: The first line contains 2 integers n,k (1¡Ün¡Ü105,0¡Ük¡Ü109). The second line contains n integers a1,a2,¡,an (0¡Üai¡Ü109). Output For each tests: A single integer denotes the minimum number of inversions. Sample Input
Sample Output
Author Xiaoxu Guo (ftiasch) Source | ||||||||||
|