Submission #501691

#TimeUsernameProblemLanguageResultExecution timeMemory
501691vinnipuh01Stove (JOI18_stove)C++17
100 / 100
48 ms3484 KiB
#include <iostream> #include <bits/stdc++.h> #include <cmath> #include <algorithm> #include <vector> #include <deque> #include <set> #include <stack> #include <string> #include <map> #include <queue> using namespace std; const long long oo = 1000000000000000000; long long int sum, ans = 0, mx = 0, mn = 1000000000, num, pos; /* ViHHiPuh (( `'-""``""-'` )) )-__-_.._-__-( / --- (o _ o) --- \ \ .-* ( .0. ) *-. / _'-. ,_ '=' _, .-'_ / `;#'#'# - #'#'#;` \ \_)) -----'#'----- ((_/ # --------- # '# ------- ------ #' /..-'# ------- #'-.\ _\...-\'# -- #'/-.../_ ((____)- '#' -(____)) cout << fixed << setprecision(6) << x; ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); freopen ( "sum.in", "r", stdin ) */ int n, m, a[ 100001 ]; vector <pair<int, int> > v; vector <int> vv; int main () { cin >> n >> m; ans = n; num = n - m; for ( int i = 1; i <= n; i ++ ) cin >> a[ i ]; for ( int i = 1; i <= n; i ++ ) v.push_back( { a[ i ], a[ i ] + 1 } ); for ( int i = 1; i < v.size(); i ++ ) { vv.push_back( v[ i ].first - v[ i - 1 ].second ); } sort( vv.begin(), vv.end() ); for ( int i = 0; i < num; i ++ ) { ans += vv[ i ]; } cout << ans; }

Compilation message (stderr)

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