m0_50201434的博客

#include <iostream>using namespace std;float a[1010],b[1010],c[2010];int main(){ int k;cin>>k; int index=0; int i=0; float x1; for( i=0;i<k;i++) { cin>>index;//cout<<index; cin>&g.

#include <iostream>#include <cstring>#include <algorithm>using namespace std;const int N=1010;int v[N],w[N];//每个物品的体积，价值int f[N][N];int main(){ int n,m; cin>>n>>m;//个数，体积上限 for(int i=1;i<=n;i++)ci

#include <iostream>#include <algorithm>#include <queue>using namespace std;int main(){ priority_queue<int ,vector<int> ,greater<int> > q; int n; cin>>n; for(int i=0;i<n;i++) {

#include <iostream>#include <algorithm>using namespace std;const int N=100100;struct Node{ int l,r; bool operator< (const Node &t) const { return r<t.r; }}node[N];int main(){ int n