sugerandmaster

#include<bits/stdc++.h>using namespace std;int main(){ int a[10005]; // n个点，固定区间长度为k，count_num记录所用区间数 int n, k, count_num; while(cin>>n>>k){ for (int i = 0; i < n; i++){ cin>>a[i];

#include<bits/stdc++.h>using namespace std;bool cmp(int a, int b){ return a>b;}int main(){ int k; int a[1010], b[1010]; int minval = 0, maxval = 0; cin>>k; for (int i = 0; i < k; i++){ cin>>a[

#include<bits/stdc++.h>using namespace std;struct Active{ int start; // 活动开始时间 int finish; // 活动结束时间 int num; // 活动编号，从1开始}actives[110];int main(){ int n; cin>>n; for (int i = 0; i < n; i++){ cin>&g

#include<bits/stdc++.h>using namespace std;int main(){ int n, k, dist[1005]; cin>>n>>k; int temp = n; int count_num = 0; // dist数组记录从上一站到第i站的距离 for (int i = 1; i <= k+1; i++){ cin>>dist[i];

#include<bits/stdc++.h>using namespace std;int main(){ int n, k, x; priority_queue<int, vector<int>, greater<int>> q1; // 从小到大排列的优先级队列 priority_queue<int> q2; // 从从大到小排列的优先级队列 cin>>n>>k; fo

#include<bits/stdc++.h>using namespace std;struct good{ int w; // 重量 int p; // 价值 int val; // 价值与重量之比}goods[15], tmp;// 冒泡排序，将货物按val值从大到小排列void my_sort(){ for (int i = 0; i < 9; i++){ for (int j = 0; j < 9-i; j+