oj.uz

Submission #914567

# Submission time Handle Problem Language Result Execution time Memory
914567 2024-01-22T10:47:41 Z Nurislam Stove (JOI18_stove) C++14
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long 
///*                                                    __                    __                        __                    */
///*        ======     _      /| /|  __   _            /   |  |   /|  |   @  |    |  |  | /   /| |\  | /   |  |  @ | /        */
///* \-       ||  |_| |_     / |/ | |  | |_  |-        |   |--|  /-|  |   |  \ \  |==|  |-   /=| | \ | |   |--|  | |-         */
///*          ||  | | |_    /     | |__|  _| |_        \__ |  | /  |  |__ |  __|  |  |  | \ /  | |  \| \__ |  |  | | \        */
///* 
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<vi> vv;
const int N = 2e6+4, inf = 1e8;

void solve(){
	int n, k;
	cin >> n >> k;
	int a[n+1]{};
	for(int i = 0; i < n; i++)cin >> a[i];
	sort(a, a+n);
	priority_queue<pii, vii, greater<pii> > v;
	for(int i = 0; i < n-1; i++){
		v.push({a[i+1]-a[i], i});
	}
	int of[n]{};
	k--;
	of[n-1] = 1;
	while(k--){
		of[v.top().ss]=1;
		v.pop();
	}
	int ans = 0, l = a[0];
	for(int i = 0; i < n; i++){
		if(of[i]){
			ans+=a[i]-l+1;
			l = a[i+1];
		}
	}cout << ans << '\n';
}
main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	int test = 1;
	//~ cin >> test;
	while(test--){
		solve();
	}
}

Compilation message

stove.cpp:45:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   45 | main(){
      | ^~~~

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -