C++实现顺序存储结构的科技竞赛志愿者名册管理程序，功能强大超实用！

```cpp #include <iostream> #include <string> #include <vector> #include <algorithm> using namespace std; struct Volunteer { string id; string name; string phone; int duration; }; vector<Volunteer> roster; void addVolunteer() { int n; cout << "Enter the number of volunteers to add: "; cin >> n; for (int i = 0; i < n; i++) { Volunteer v; cout << "Enter volunteer's ID: "; cin >> v.id; cout << "Enter volunteer's name: "; cin >> v.name; cout << "Enter volunteer's phone number: "; cin >> v.phone; v.duration = 0; roster.push_back(v); } cout << "Volunteers added successfully." << endl; } void insertVolunteer() { int pos; Volunteer v; cout << "Enter the position to insert the volunteer: "; cin >> pos; cout << "Enter volunteer's ID: "; cin >> v.id; cout << "Enter volunteer's name: "; cin >> v.name; cout << "Enter volunteer's phone number: "; cin >> v.phone; v.duration = 0; roster.insert(roster.begin() + pos, v); cout << "Volunteer inserted successfully." << endl; } void modifyVolunteer() { string searchKey; cout << "Enter volunteer's ID or name to search: "; cin >> searchKey; for (Volunteer& v : roster) { if (v.id == searchKey || v.name == searchKey) { cout << "Enter new ID: "; cin >> v.id; cout << "Enter new name: "; cin >> v.name; cout << "Enter new phone number: "; cin >> v.phone; cout << "Volunteer information modified successfully." << endl; return; } } cout << "Volunteer not found!" << endl; } void deleteVolunteer() { string searchKey; cout << "Enter volunteer's ID to delete: "; cin >> searchKey; for (auto it = roster.begin(); it != roster.end(); ++it) { if (it->id == searchKey) { it = roster.erase(it); cout << "Volunteer deleted successfully." << endl; return; } } cout << "Volunteer not found!" << endl; } void printRoster() { for (const Volunteer& v : roster) { cout << "ID: " << v.id << " | Name: " << v.name << " | Phone: " << v.phone << " | Duration: " << v.duration << endl; } cout << "Total number of volunteers: " << roster.size() << endl; } void sortByDuration() { sort(roster.begin(), roster.end(), [](const Volunteer &a, const Volunteer &b) { return a.duration > b.duration; }); cout << "Volunteers sorted by duration:" << endl; printRoster(); } int main() { // Initialize some volunteers Volunteer v1 = {"001", "Alice", "123-456-7890", 10}; Volunteer v2 = {"002", "Bob", "321-654-0987", 5}; Volunteer v3 = {"003", "Charlie", "456-789-0123", 8}; roster = {v1, v2, v3}; int choice; do { cout << "\n1. Add Volunteer\n2. Insert Volunteer\n3. Modify Volunteer\n4. Delete Volunteer\n5. Print Roster\n6. Sort by Duration\n7. Exit\n"; cout << "Enter your choice: "; cin >> choice; switch (choice) { case 1: addVolunteer(); break; case 2: insertVolunteer(); break; case 3: modifyVolunteer(); break; case 4: deleteVolunteer(); break; case 5: printRoster(); break; case 6: sortByDuration(); break; case 7: cout << "Exiting program..." << endl; break; default: cout << "Invalid choice. Please try again." << endl; } } while (choice != 7); return 0; } ``` ######[AI写代码神器 | 2584点数解答 | 2024-12-16 11:13:13]