以下代码未经过测试,若有错误欢迎指正
1.和最接近但不超过K的两个元素
二分
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
using namespace std;
int a[10005];
int main(){
int n,k;
cin>>n>>k;
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
int l=0,r=n-1;
int ans=a[0]+a[1];
while(l<r){
int sum=a[l]+a[r];
if(sum<=k){
if(k-sum<k-ans) ans=sum;
}
if(sum==k) {
cout<<k<<endl;
return 0;
}
else if(sum<k) l++;
else r--;
}
cout<<ans<<endl;
}
2.附近编号最大的城市
非负权有向图的有源最短路,使用Dijkstra算法求解
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
using namespace std;
const int maxn = 105;
const int maxm = 10005;
const int INF = 0x3f3f3f3f;
int umap[maxn][maxn];//邻接矩阵
bool vis[maxn];//标记dis数组
int dis[maxn];
int n,k;
int dijstra( int s){
memset(vis,0,sizeof(vis));
for(int i=0;i<n;i++){
dis[i]=umap[s][i];
}
vis[s]=1;
dis[s]=0;
for(int i=0;i<n;i++){
int pos;
int minv=INF;
for(int j=0;j<n;j++){
if(!vis[j]&&minv>dis[j]){
pos=j;
minv=dis[j];
}
}
vis[pos]=true;
for(int j=0;j<n;j++){
if(!vis[j]&&dis[j]>dis[pos]+umap[pos][j]){
dis[j]=dis[pos]+umap[pos][j];
}
}
}
int ans=INF;
for(int i=1;i<n;i++){
//cout<<dis[i]<<endl;
if(dis[i]<k){
if(abs(dis[i]-k)<abs(ans-k)){
ans=i+1;
}
}
}
return ans;
}
int main(){
while(cin>>n>>k&&(n)){
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin>>umap[i][j];
//if(umap[i][j]==0) umap[i][j]=INF;
}
}
cout<<dijstra(0)<<endl;
}
}
C.硬币问题
完全背包问题
D.制作蛋糕 贪心
int main(){
int fen,jiao,tang,tou,ke;
cin>>fen>>jiao>>tamg>>tou>>ke;
int x[5]={250,2,75,100,0};
int q[5]={200,0,150,150,75};
}
E.最短路
F.木材切割
https://blog.csdn.net/weixin_41650348/article/details/108519826?utm_medium=distribute.pc_relevant_t0.none-task-blog-OPENSEARCH-1.control&depth_1-utm_source=distribute.pc_relevant_t0.none-task-blog-OPENSEARCH-1.control