Submission #769337

#TimeUsernameProblemLanguageResultExecution timeMemory
769337Mery2005Stove (JOI18_stove)C++14
0 / 100
1 ms340 KiB
#include <iostream> #include <algorithm> #include <queue> #include <cmath> #include <vector> #include <list> #include <string> #include <unordered_map> #include <map> #include <set> #include <stack> #include <string> #include <iomanip> #include <fstream> using namespace std; void fastio() { ios_base::sync_with_stdio(false); cin.tie(0); } const long long mod = 1e9+7; const int N = 3e6+5; int a[N] , dp[N]; void solve(){ int n , k; cin >> n >> k; for(int i = 1 ; i <= n ; i++){ cin >> a[i]; } sort(a + 1 , a + n + 1); vector<int> v; int start = a[1]; for(int i = 2 ; i <= n ; i++){ if(a[i] - start != 1){ v.push_back(a[i] - start - 1); } start = a[i]; } sort(v.begin() , v.end()); long long int ans = n * 1ll; for(int i = 0 ; i < (v.size()-k + 1) ; i++){ ans += v[i] * 1ll; } cout << ans << endl; } int main(){ solve(); return 0; }

Compilation message (stderr)

stove.cpp: In function 'void solve()':
stove.cpp:44:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |   for(int i = 0 ; i < (v.size()-k + 1) ; i++){
      |                   ~~^~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...