// cre: Nguyen Ngoc Hung - Train VOI 2024 :>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <unordered_set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <cstring>
#include <unordered_map>
#include <cmath>
#include <cassert>
#include <random>
using namespace std;
#define SORT_UNIQUE(v) sort(ALL(v)),(v).resize(unique(ALL(v))-(v).begin())
#define __nnhzzz__ signed main()
#define BIT(i,j) ((i>>j)&1LL)
#define MASK(i) (1LL<<i)
#define RALL(x) (x).rbegin(),(x).rend()
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) (int)(x).size()
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define ll long long
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vpii vector<pii>
#define RESET(x,val) memset((x),(val),sizeof(x))
#define REPDIS(i,be,en,j) for(int i = (be); i<=(en); i+=j)
#define REPD(i,be,en) for(int i = (be); i>=(en); i--)
#define REP(i,be,en) for(int i = (be); i<=(en); i++)
//-------------------------------------------------------------//
const int oo = 1e9,LOG = 20,MAXN = 5e3+7,N = 1e2+3;
const int MOD = 1e9+7,MOD1 = 1e9+207,MOD2 = 1e9+407,MOD3 = 998244353;
//-------------------------------------------------------------//
template<typename T1, typename T2> bool mini(T1 &a, T2 b){if(a>b){a=b;return true;}return false;}
template<typename T1, typename T2> bool maxi(T1 &a, T2 b){if(a<b){a=b;return true;}return false;}
template<typename T> T gcd(T a, T b) { while(b) { a %= b; swap(a,b); } return a; }
template<typename T> T lcm(T a, T b) { return a/gcd(a,b)*b; }
/*
----------------------------------------------------------------
END OF TEMPLATE
----------------------------------------------------------------
Nguyen Ngoc Hung - nnhzzz
Training for VOI24 gold medal
----------------------------------------------------------------
*/
int a[MAXN],dp[MAXN][MAXN];
void solve(){
int n,ma; cin >> n >> ma;
REP(i,1,n){
cin >> a[i];
}
sort(a+1,a+n+1);
memset(dp,0x3f3f3f3f,sizeof dp);
dp[0][0] = 0;
REP(j,1,ma){
REP(i,1,n){
REP(pre,0,i-1){
mini(dp[i][j],dp[pre][j-1]+(a[i]+1)-a[pre+1]);
}
}
}
cout << dp[n][ma];
}
__nnhzzz__{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#define name "test"
if(fopen(name".inp","r")){
freopen(name".inp","r",stdin);
freopen(name".out","w",stdout);
}
#define name1 "nnhzzz"
if(fopen(name1".inp","r")){
freopen(name1".inp","r",stdin);
freopen(name1".out","w",stdout);
}
int test = 1;
while(test--){
solve();
}
cerr << "\nTime elapsed: " << 1000*clock()/CLOCKS_PER_SEC << "ms\n";
return 0;
}
Compilation message
stove.cpp: In function 'int main()':
stove.cpp:108:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
108 | freopen(name".inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
stove.cpp:109:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
109 | freopen(name".out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
stove.cpp:113:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
113 | freopen(name1".inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
stove.cpp:114:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
114 | freopen(name1".out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
35 ms |
98516 KB |
Output is correct |
| 2 |
Correct |
34 ms |
98312 KB |
Output is correct |
| 3 |
Correct |
33 ms |
98380 KB |
Output is correct |
| 4 |
Correct |
33 ms |
98316 KB |
Output is correct |
| 5 |
Correct |
34 ms |
98376 KB |
Output is correct |
| 6 |
Correct |
34 ms |
98356 KB |
Output is correct |
| 7 |
Correct |
33 ms |
98384 KB |
Output is correct |
| 8 |
Correct |
34 ms |
98356 KB |
Output is correct |
| 9 |
Correct |
33 ms |
98364 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
35 ms |
98516 KB |
Output is correct |
| 2 |
Correct |
34 ms |
98312 KB |
Output is correct |
| 3 |
Correct |
33 ms |
98380 KB |
Output is correct |
| 4 |
Correct |
33 ms |
98316 KB |
Output is correct |
| 5 |
Correct |
34 ms |
98376 KB |
Output is correct |
| 6 |
Correct |
34 ms |
98356 KB |
Output is correct |
| 7 |
Correct |
33 ms |
98384 KB |
Output is correct |
| 8 |
Correct |
34 ms |
98356 KB |
Output is correct |
| 9 |
Correct |
33 ms |
98364 KB |
Output is correct |
| 10 |
Correct |
214 ms |
98388 KB |
Output is correct |
| 11 |
Execution timed out |
1085 ms |
98416 KB |
Time limit exceeded |
| 12 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
35 ms |
98516 KB |
Output is correct |
| 2 |
Correct |
34 ms |
98312 KB |
Output is correct |
| 3 |
Correct |
33 ms |
98380 KB |
Output is correct |
| 4 |
Correct |
33 ms |
98316 KB |
Output is correct |
| 5 |
Correct |
34 ms |
98376 KB |
Output is correct |
| 6 |
Correct |
34 ms |
98356 KB |
Output is correct |
| 7 |
Correct |
33 ms |
98384 KB |
Output is correct |
| 8 |
Correct |
34 ms |
98356 KB |
Output is correct |
| 9 |
Correct |
33 ms |
98364 KB |
Output is correct |
| 10 |
Correct |
214 ms |
98388 KB |
Output is correct |
| 11 |
Execution timed out |
1085 ms |
98416 KB |
Time limit exceeded |
| 12 |
Halted |
0 ms |
0 KB |
- |
