C++作业-CSDN博客

#include<bits/stdc++.h>
using namespace std;
int main(){
	double n;
	cin>>n;
	int i=0;
	int m=10*n;
	int sum=0;
	int a[9]={1000,500,200,100,50,20,10,5,1};
	int cnt[10]={0};
	while(m!=0){
		if(m-a[i]>=0){
			m-=a[i];
			cnt[i]++;
			sum++;
		}
		else i++;
	}
	for(int i=0;i<9;i++){
		cout<<a[i]/10.0<<":"<<cnt[i]<<endl;
	}
	return 0;
}

#include <iostream> 
#include <iomanip> 
using namespace std; 

int main() { 
	int k; 
	cin >> k;  
	
	while (k--) { 
		int w, s; 
		cin >> w >> s; 
		
		int n[1000], v[1000];  
		for (int i = 0; i < s; ++i) { 
			cin >> n[i] >> v[i]; 
		} 
		
		
		for (int i = 0; i < s - 1; ++i) { 
			for (int j = i + 1; j < s; ++j) { 
				double u1 = (double)v[i] / n[i]; 
				double u2 = (double)v[j] / n[j]; 
				if (u1< u2) { 
					swap(n[i], n[j]); 
					swap(v[i], v[j]); 
				} 
			} 
		} 
		
		double t = 0.0; 
		int r = w;  
		for (int i = 0; i < s; ++i) { 
			if (r <= 0) break; 
			if (n[i] <= r) { 
				t += v[i]; 
				r -= n[i]; 
			} else { 
				t += (double)v[i] / n[i] * r; 
				r = 0;
			} 
		} 
		cout << fixed << setprecision(2) << t << endl; 
	} 
	
	return 0; 
}

#include <iostream> 
#include <algorithm> 
using namespace std; 

int main() { 
	int n, r; 
	cin >> n >> r; 
	int t[500];
	for (int i = 0; i < n; ++i) { 
		cin >> t[i]; 
	} 
	sort(t, t + n); 
	int t1[100] = {0};  
	int sum = 0; 
	for (int i = 0; i < n; ++i) { 
		int j = i % r; 
		sum += t1[j] + t[i]; 
		t1[j] += t[i]; 
	} 
	cout << sum << endl; 
	return 0; 
}

#include <iostream> 
using namespace std;
int main() { 
	int k; 
	cin >> k; 
	while (k--) { 
		int n; 
		cin >> n; 
		int p[10000];  
		for (int i = 0; i < n; i++) { 
			cin >> p[i]; 
		} 
		int sum = 0; 
		for (int i = 0; i < n; i =i+ 2) {   
			sum =sum+ p[i + 1] - p[i]; 
		} 
		cout << sum << endl; 
	} 
	return 0; 
}