Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int n, k;
- int l[300000], r[300000];
- int d;
- int m[300000];
- int main() {
- cin >> n >> k;
- int mx = 0;
- for(int i = 0; i < n; i++){
- cin >> l[i] >> r[i];
- }
- for(int i = 0; i < n; i++){
- int cnt = k;
- int sum = 0;
- int num[300000];
- int p = 1;
- num[0] = i;
- for(int j = 0; j < n; j++){
- if((l[i] <= l[j] && r[i] >= r[j]) && (i != j)){
- sum += (r[j] - l[j]);
- num[p] = j;
- cnt--;
- }
- else if(i!=j && l[i] <= l[j] && r[i] <= r[j]){
- sum += (r[i] - l[j]);
- num[p] = j;
- cnt--;
- }
- else if(i!=j && r[i] >= r[j] && l[i] >= l[j]){
- sum += (r[j] - l[i]);
- num[p] = j;
- cnt --;
- }
- p++;
- }
- if(sum > mx){
- mx = sum;
- for(int i = 0; i < k; i++){
- m[i] = num[i];
- }
- }
- }
- cout << mx << endl;
- for(int i = 0; i < k; i++){
- cout << m[i] << " ";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement