6.1vector常见用法详解
![](https://i-blog.csdnimg.cn/direct/c3359aeaa68f4ede93c4d0db02df84e7.png)
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int n, x;
scanf("%d", &n);
vector<int> v;
for (int i = 0; i < n; i++) {
scanf("%d", &x);
v.push_back(x);
}
for (int i = 0; i < (int)v.size(); i++) {
printf("%d", v[i]);
if (i < (int)v.size() - 1) {
printf(" ");
}
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/b1c2ba1d708f498281a695ab8348f39a.png)
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int n, k;
scanf("%d%d", &n, &k);
vector<int> v(n, k);
for (int i = 0; i < (int)v.size(); i++) {
printf("%d", v[i]);
if (i < (int)v.size() - 1) {
printf(" ");
}
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/becead8350124907aa6d3d7db94a5116.png)
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int n, k;
scanf("%d%d", &n, &k);
vector<int> v(n, 0);
for (int i = 0; i < k; i++) {
v.pop_back();
}
printf("%d", (int)v.size());
return 0;
}
![](https://i-blog.csdnimg.cn/direct/e562bd165c7f41848e26cf534fe05210.png)
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int n, k;
scanf("%d%d", &n, &k);
vector<int> v(n, 0);
v.clear();
printf("%d", (int)v.size());
return 0;
}
![](https://i-blog.csdnimg.cn/direct/2458090c1cfc4b5ab77628930e20b7c2.png)
![](https://i-blog.csdnimg.cn/direct/c27879c4d4fa4d3f90122db6956072b4.png)
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int n, x, k1, k2;
scanf("%d", &n);
vector<int> v;
for (int i = 0; i < n; i++) {
scanf("%d", &x);
v.push_back(x);
}
scanf("%d%d%d", &x, &k1, &k2);
v.insert(v.begin() + k1, x);
v.erase(v.begin() + k2);
for (int i = 0; i < (int)v.size(); i++) {
printf("%d", v[i]);
if (i < (int)v.size() - 1) {
printf(" ");
}
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/295a4a10b06e4bf4b1753d1135615fea.png)
![](https://i-blog.csdnimg.cn/direct/c2fee763065e408c9574b7a779cfac7a.png)
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int n, m, x;
scanf("%d%d", &n, &m);
vector<int> v1, v2;
for (int i = 0; i < n; i++) {
scanf("%d", &x);
v1.push_back(x);
}
for (int i = 0; i < m; i++) {
scanf("%d", &x);
v2.push_back(x);
}
printf(v1 < v2 ? "Yes" : "No");
return 0;
}
![](https://i-blog.csdnimg.cn/direct/0f120f5e27cb4a19970237428df16dff.png)
![](https://i-blog.csdnimg.cn/direct/ed24dc94e71f4cbeabe2a30abbf794b5.png)
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int n, k, x;
scanf("%d", &n);
vector<int> vs[10];
for (int i = 0; i < n; i++) {
scanf("%d", &k);
for (int j = 0; j < k; j++) {
scanf("%d", &x);
vs[i].push_back(x);
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < (int)vs[i].size(); j++) {
printf("%d", vs[i][j]);
if (j < (int)vs[i].size() - 1) {
printf(" ");
} else {
printf("\n");
}
}
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/71c79de200af49da91b11288c3707631.png)
![](https://i-blog.csdnimg.cn/direct/bdd94b4e474f4be8933e673b8f282cad.png)
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int n, k, x;
scanf("%d", &n);
vector<vector<int> > vs(n, vector<int>());
for (int i = 0; i < n; i++) {
scanf("%d", &k);
for (int j = 0; j < k; j++) {
scanf("%d", &x);
vs[i].push_back(x);
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < (int)vs[i].size(); j++) {
printf("%d", vs[i][j]);
if (j < (int)vs[i].size() - 1) {
printf(" ");
} else {
printf("\n");
}
}
}
return 0;
}
6.2set的常见用法详解
![](https://i-blog.csdnimg.cn/direct/d92c927806dc4cd49580af504beebdae.png)
#include <cstdio>
#include <set>
using namespace std;
int main() {
int n, x;
scanf("%d", &n);
set<int> s;
for (int i = 0; i < n; i++) {
scanf("%d", &x);
s.insert(x);
}
for (set<int>::iterator it = s.begin(); it != s.end(); it++) {
if (it != s.begin()) {
printf(" ");
}
printf("%d", *it);
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/50e74d92539246e19769bbffc080c532.png)
![](https://i-blog.csdnimg.cn/direct/fa712d0f0f9641fa9f369fb067c16fcd.png)
#include <cstdio>
#include <set>
using namespace std;
int main() {
int n, x;
scanf("%d%d", &n, &x);
set<int> s;
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
s.insert(a);
};
set<int>::iterator it = s.find(x);
if (it != s.end()) {
s.erase(it);
}
for (set<int>::iterator it = s.begin(); it != s.end(); it++) {
if (it != s.begin()) {
printf(" ");
}
printf("%d", *it);
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/1a74521181b541e49a44ad7a1e774f14.png)
![](https://i-blog.csdnimg.cn/direct/097dd909ae2d48e4aa1e8cea36aa9680.png)
#include <cstdio>
#include <set>
using namespace std;
int main() {
int n, x;
scanf("%d%d", &n, &x);
set<int> s;
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
s.insert(a);
};
s.erase(x);
for (set<int>::iterator it = s.begin(); it != s.end(); it++) {
if (it != s.begin()) {
printf(" ");
}
printf("%d", *it);
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/f41971851f4942378a50e23d6dc29b4c.png)
![](https://i-blog.csdnimg.cn/direct/d4596fdcf532437c8f6722c549c28640.png)
#include <cstdio>
#include <set>
using namespace std;
int main() {
int n, x;
scanf("%d%d", &n, &x);
set<int> s;
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
s.insert(a);
};
s.clear();
printf("%d", (int)s.size());
return 0;
}
6.3string的常见用法详解
![](https://i-blog.csdnimg.cn/direct/764873de78474389a8e448648f6c0a48.png)
#include <iostream>
#include <string>
using namespace std;
int main () {
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
cout << s[i];
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/3e59dcd7e3f047e9be393906d0ea6e1d.png)
#include <iostream>
#include <string>
using namespace std;
int main () {
string s;
getline(cin, s);
for (int i = 0; i < s.length(); i++) {
cout << s[i];
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/c75071574cea45e08526c4b98335df6d.png)
#include <iostream>
#include <string>
using namespace std;
int main () {
string s1,s2;
cin>>s1>>s2;
string s3=s1+s2;
for (int i = 0; i < s3.length(); i++) {
cout << s3[i];
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/13377e0d805d4fd49d61a5b4f4a5151d.png)
#include <iostream>
#include <string>
using namespace std;
int main () {
string s1,s2;
cin>>s1>>s2;
if(s1>s2)printf("1");
else if(s1==s2)printf("0");
else printf("-1");
return 0;
}
![](https://i-blog.csdnimg.cn/direct/648e877b7b6f4d2c8da95ebd67f8620f.png)
#include <iostream>
#include <string>
using namespace std;
int main () {
string s;
cin>>s;
printf("%d ",s.length());
s.clear();
printf("%d",s.length());
return 0;
}
![](https://i-blog.csdnimg.cn/direct/1beaf83380a74d149609b4f4a67ac632.png)
![](https://i-blog.csdnimg.cn/direct/f7f21ad4304f474a819cb5dfbf34ee47.png)
#include <iostream>
#include <string>
using namespace std;
int main () {
string s;
cin >> s;
int k1, k2;
char c;
cin >> k1 >> c >> k2;
s.insert(s.begin() + k1, c);
s.erase(s.begin() + k2);
cout << s;
return 0;
}
![](https://i-blog.csdnimg.cn/direct/f4b47f1c6fee4a2984180c2fd25d700f.png)
![](https://i-blog.csdnimg.cn/direct/42f79978744f497f985a650a4ca88fc6.png)
![](https://i-blog.csdnimg.cn/direct/96d0f70e18c64cceb7fdda2e38ffdad9.png)
#include <iostream>
#include <string>
using namespace std;
int main () {
string s1,s2;
cin >> s1>>s2;
printf("%d",s1.find(s2));
return 0;
}
![](https://i-blog.csdnimg.cn/direct/8e14a1ca5f594105924189f8c5a015ec.png)
![](https://i-blog.csdnimg.cn/direct/db31318170ec43d5bf35afb8b64ab687.png)
#include <iostream>
#include <string>
using namespace std;
int main () {
string s1,s2;
cin >> s1;
int k,len;
cin>>k>>len;
cin>>s2;
string s3=s1.replace(k,len,s2);
cout<<s3;
return 0;
}
6.4map的常见用法详解
![](https://i-blog.csdnimg.cn/direct/57d8772af26a4fe8a032f4929aa9a7b9.png)
![](https://i-blog.csdnimg.cn/direct/49fe53637ae54d5aab8cce0ab08c4263.png)
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, x;
char c;
cin >> n;
map<char, int> mp;
for (int i = 0; i < n; i++) {
cin >> c >> x;
mp[c] = x;
}
for (map<char, int>::iterator it = mp.begin(); it != mp.end(); it++) {
cout << it -> first << " " << it -> second << endl;
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/6864c75af251449386d90e8571e73651.png)
![](https://i-blog.csdnimg.cn/direct/3839e28bae934605ab1bc21859118ea3.png)
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, x;
char c;
cin >> n;
map<char, int> mp;
for (int i = 0; i < n; i++) {
cin >> c >> x;
mp[c] = x;
}
for (map<char, int>::iterator it = mp.begin(); it != mp.end(); it++) {
cout << it -> first << " " << it -> second << endl;
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/9c374b19efde408fa49b06819337cf86.png)
![](https://i-blog.csdnimg.cn/direct/bc4206f522634819bbb7bc2cf4065708.png)
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, x;
char c;
cin >> n;
map<char, int> mp;
for (int i = 0; i < n; i++) {
cin >> c >> x;
mp[c] = x;
}
char k;
cin>>k;
if (mp.find(k) != mp.end()) {
cout << mp[k];
} else {
cout << -1;
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/427e9b8ebad54fffb3854b5d763f04ce.png)
![](https://i-blog.csdnimg.cn/direct/45ae3fa4ddb148619876c52067a760b6.png)
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, x;
char c;
cin >> n;
map<char, int> mp;
for (int i = 0; i < n; i++) {
cin >> c >> x;
mp[c] = x;
}
char k;
cin>>k;
mp.erase(k);
for (map<char, int>::iterator it = mp.begin(); it != mp.end(); it++) {
cout << it -> first << " " << it -> second << endl;
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/0d50d737d02b4c96a8b914883ea82b25.png)
![](https://i-blog.csdnimg.cn/direct/29d2e166822747cca206b6028512537b.png)
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, x;
char c;
cin >> n;
map<char, int> mp;
for (int i = 0; i < n; i++) {
cin >> c >> x;
mp[c] = x;
}
cout<<mp.size()<<" ";
mp.clear();
cout<<mp.size();
return 0;
}
![](https://i-blog.csdnimg.cn/direct/c39c9b2873c34ebda055fadc0a219f52.png)
![](https://i-blog.csdnimg.cn/direct/9ae51496e96241a6ab8d03eb2e6407b2.png)
#include <iostream>
#include <map>
using namespace std;
int main() {
int n;
string str;
cin >> n;
map<string, int> mp;
for (int i = 0; i < n; i++) {
cin >> str;
if (mp.find(str) == mp.end()) {
mp[str] = 1;
} else {
mp[str]++;
}
}
for (map<string, int>::iterator it = mp.begin(); it != mp.end(); it++) {
cout << it -> first << " " << it -> second << endl;
}
return 0;
}
6.5queue的常见用法详解
![](https://i-blog.csdnimg.cn/direct/a69f24b49e1b4ca6a3e0cc9dd7f1b2cd.png)
#include <iostream>
#include <queue>
using namespace std;
int main() {
int n, x;
cin >> n;
queue<int> q;
for (int i = 0; i < n; i++) {
cin >> x;
q.push(x);
}
cout << q.front() << " " << q.back();
return 0;
}
![](https://i-blog.csdnimg.cn/direct/b9605a5b45924d73b9c405caab1978e4.png)
![](https://i-blog.csdnimg.cn/direct/b563b5307d0c4ff19e38ec8e8dc80969.png)
#include <iostream>
#include <queue>
using namespace std;
int main() {
int n, x,k;
cin >> n;
cin>>k;
queue<int> q;
for (int i = 0; i < n; i++) {
cin >> x;
q.push(x);
}
for (int i = 0; i < k; i++) {
q.pop();
}
if (q.empty()) {
cout << "empty queue";
} else {
cout << q.front() << " " << q.back();
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/2710c20a2c12425e9d5bac954e10d676.png)
![](https://i-blog.csdnimg.cn/direct/0865062ae85f4185b3c31cda6950ac67.png)
#include <iostream>
#include <queue>
using namespace std;
int main() {
int n, x,k;
cin >> n;
cin>>k;
queue<int> q;
for (int i = 0; i < n; i++) {
cin >> x;
q.push(x);
}
for (int i = 0; i < k; i++) {
q.pop();
}
cout<<q.size();
return 0;
}
6.6priority_queue的常见用法详解
![](https://i-blog.csdnimg.cn/direct/d1f0d71408a34ef0bcb700010964df57.png)
#include <iostream>
#include <queue>
using namespace std;
int main() {
int n, x;
cin >> n;
priority_queue<int> q;
for (int i = 0; i < n; i++) {
cin >> x;
q.push(x);
}
cout << q.top();
return 0;
}
![](https://i-blog.csdnimg.cn/direct/b7959e81104c42a4bb9f662d2bf2814e.png)
![](https://i-blog.csdnimg.cn/direct/b29d8dbcce894b40915040fa0df655f9.png)
#include <iostream>
#include <queue>
using namespace std;
int main() {
int n, x,k;
cin >> n>>k;
priority_queue<int> q;
for (int i = 0; i < n; i++) {
cin >> x;
q.push(x);
}
for (int i = 0; i < k; i++) {
q.pop();
}
if(q.empty())
{
cout<<"empty priority queue";
}
else{
cout<<q.top();
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/a47ef1c6b697411098a3f77e81850048.png)
#include <iostream>
#include <queue>
using namespace std;
int main() {
int n, x,k;
cin >> n>>k;
priority_queue<int> q;
for (int i = 0; i < n; i++) {
cin >> x;
q.push(x);
}
for (int i = 0; i < k; i++) {
q.pop();
}
cout<<q.size();
return 0;
}
![](https://i-blog.csdnimg.cn/direct/02d4449335d841dfa753a92e97e63c7a.png)
#include <iostream>
#include <queue>
using namespace std;
int main() {
int n, x;
cin >> n;
priority_queue<int, vector<int>, greater<int>> q;
for (int i = 0; i < n; i++) {
cin >> x;
q.push(x);
}
cout<<q.top();
return 0;
}
![](https://i-blog.csdnimg.cn/direct/e8ad84d240de4fdbaf83b868a2f859d8.png)
![](https://i-blog.csdnimg.cn/direct/c55ca612836e4d0698b0d9f1bcf1436c.png)
#include <iostream>
#include <queue>
using namespace std;
struct Fruit {
string name;
int price;
Fruit(string _name, int _price) {
name = _name;
price = _price;
}
bool operator<(const Fruit& other) const {
return price > other.price;
}
};
int main() {
int n, price;
string name;
cin >> n;
priority_queue<Fruit> q;
for (int i = 0; i < n; i++) {
cin >> name >> price;
q.push(Fruit(name, price));
}
Fruit topFruit = q.top();
cout << topFruit.name << " " << topFruit.price;
return 0;
}
6.7stack的常见用法详解
![](https://i-blog.csdnimg.cn/direct/dfe7757317114d6e824ee9c1bf965b4e.png)
#include <iostream>
#include <stack>
using namespace std;
int main() {
int n, x;
cin >> n;
stack<int> s;
for (int i = 0; i < n; i++) {
cin >> x;
s.push(x);
}
cout << s.top();
return 0;
}
![](https://i-blog.csdnimg.cn/direct/e06abfb6d59d4b86be7e7192c390f65c.png)
![](https://i-blog.csdnimg.cn/direct/0ab2f91283cd40f9ae2ba19fd35c0afc.png)
#include <iostream>
#include <stack>
using namespace std;
int main() {
int n, x,k;
cin >> n>>k;
stack<int> s;
for (int i = 0; i < n; i++) {
cin >> x;
s.push(x);
}
for (int i = 0; i < k; i++) {
s.pop();
}
if(s.empty())
{
cout<<"empty stack";
}
else
{cout << s.top();}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/5a32a1d6922e40a385e5ba2efe4fa8a0.png)
#include <iostream>
#include <stack>
using namespace std;
int main() {
int n, x,k;
cin >> n>>k;
stack<int> s;
for (int i = 0; i < n; i++) {
cin >> x;
s.push(x);
}
for (int i = 0; i < k; i++) {
s.pop();
}
cout<<s.size();
return 0;
}
6.8pair的常见用法详解
![](https://i-blog.csdnimg.cn/direct/8107be1f96394adcb03284ae43f7e257.png)
#include <iostream>
#include <utility>
using namespace std;
int main() {
string str;
int k;
cin >> str >> k;
pair<string, int> p = make_pair(str, k);
cout << p.first << " " << p.second;
return 0;
}
![](https://i-blog.csdnimg.cn/direct/6d982d1e733a429b9c7998cc23fd7ac2.png)
![](https://i-blog.csdnimg.cn/direct/ee2b0273635b48089f3118ae21b23798.png)
#include <iostream>
#include <utility>
using namespace std;
int main() {
string str;
int k1,k2,k3,k4;
cin>>k1>>k2>>k3>>k4;
pair<int, int> p1 = make_pair(k1, k2);
pair<int, int> p2 = make_pair(k3, k4);
if(p1<p2)
{
cout<<"Yes";
}
else{
cout<<"No";
}
return 0;
}
6.9algorithm头文件下的常用函数
![](https://i-blog.csdnimg.cn/direct/279ef4fee3ca4b5da7e4192cd5818bac.png)
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
printf("%d", min(a, b));
return 0;
}
![](https://i-blog.csdnimg.cn/direct/c95b66fa4fb44336bf093c8c4de4dcf3.png)
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
printf("%d", max(a, b));
return 0;
}
![](https://i-blog.csdnimg.cn/direct/2957dec39da2474ba3dba90aff160544.png)
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
int a;
scanf("%d", &a);
printf("%d", abs(a));
return 0;
}
![](https://i-blog.csdnimg.cn/direct/b6bf04c44c1e4a39ab3fd4cf71327ae2.png)
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
swap(a,b);
printf("%d %d", a, b);
return 0;
}
![](https://i-blog.csdnimg.cn/direct/8140e53200af41fa98100371c8046e46.png)
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
int n,x;
vector<int> v;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&x);
v.push_back(x);
}
reverse(v.begin(), v.end());
for (int i = 0; i < (int)v.size(); i++) {
printf("%d", v[i]);
if (i < (int)v.size() - 1) {
printf(" ");
}
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/3d8cc3e3dc9544688d9983f996dad3d7.png)
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string str;
cin >> str;
reverse(str.begin(), str.end());
cout << str;
return 0;
}
![](https://i-blog.csdnimg.cn/direct/1b309ea30a8e4c2aa44a021e27c8f215.png)
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, x;
scanf("%d", &n);
vector<int> v;
for (int i = 1; i <= n; i++) {
v.push_back(i);
}
do {
for (int i = 0; i < n; i++) {
printf("%d", v[i]);
if (i < n - 1) {
printf(" ");
} else {
printf("\n");
}
}
} while (next_permutation(v.begin(), v.end()));
return 0;
}
![](https://i-blog.csdnimg.cn/direct/04fabba34d414c8b892c63345d868018.png)
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
int n, k, a[100];
scanf("%d%d", &n, &k);
fill(a, a + n, k);
for (int i = 0; i < n; i++) {
printf("%d", a[i]);
if (i < n - 1) {
printf(" ");
}
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/07432838476c4219a72287233fbce9c1.png)
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
int n = 3, m = 5, k, a[3][5];
scanf("%d", &k);
fill(&a[0][0], &a[0][0] + n * m, k);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
printf("%d", a[i][j]);
if (j < m - 1) {
printf(" ");
} else {
printf("\n");
}
}
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/96c8e105d46e43a7ae594005ab87ac83.png)
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN = 10;
int a[MAXN];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
for (int i = 0; i < n; i++) {
printf("%d", a[i]);
if (i < n - 1) {
printf(" ");
}
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/27a2c8f5a82845ffbc478af2978afb59.png)
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN = 10;
int a[MAXN];
bool cmp(int a, int b) {
return a > b;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n, cmp);
for (int i = 0; i < n; i++) {
printf("%d", a[i]);
if (i < n - 1) {
printf(" ");
}
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/43aa926bacd749ecbedfe21d01c3f337.png)
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
const int MAXN = 10;
string str[MAXN];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> str[i];
}
sort(str, str + n);
for (int i = 0; i < n; i++) {
cout << str[i] << endl;
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/ebe17ff94f0c444ba07bc36bde872fff.png)
![](https://i-blog.csdnimg.cn/direct/163da4c6aadd493f9a568763b9a07e35.png)
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
struct Node {
int x, y;
Node(int _x, int _y) {
x = _x;
y = _y;
}
};
bool cmp(Node a, Node b) {
if (a.x != b.x) {
return a.x < b.x;
} else {
return a.y < b.y;
}
}
int main() {
int n, x, y;
scanf("%d", &n);
vector<Node> v;
for (int i = 0; i < n; i++) {
scanf("%d%d", &x, &y);
v.push_back(Node(x, y));
}
sort(v.begin(), v.end(), cmp);
for (int i = 0; i < n; i++) {
printf("%d %d\n", v[i].x, v[i].y);
}
return 0;
}
![](https://i-blog.csdnimg.cn/direct/e4819cf7c3a84b8886809556b4ad96c2.png)
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN = 10;
int a[MAXN];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int pos = lower_bound(a, a + n, k) - a;
printf("%d", pos + 1);
return 0;
}
![](https://i-blog.csdnimg.cn/direct/f7ff96775dc04b3a9853dd0b7d81f9c3.png)
![](https://i-blog.csdnimg.cn/direct/5863a301135e49baa7a57576bb4eaccf.png)
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN = 10;
int a[MAXN];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int pos = upper_bound(a, a + n, k) - a;
printf("%d", pos + 1);
return 0;
}