Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "pch.h"
- #include <iostream>
- #include <string>
- #include <algorithm>
- using namespace std;
- struct slowo
- {
- string tekst;
- int dl;
- };
- bool sortuj(slowo x, slowo y)
- {
- return (x.dl < y.dl);
- }
- slowo tab[150];
- int N;
- int main()
- {
- cin >> N;
- for (int i = 0; i < N; i++)
- {
- cin >> tab[i].tekst;
- tab[i].dl = tab[i].tekst.size();
- }
- for (int i = 0; i < N; i++)
- cout << tab[i].tekst << " " << tab[i].dl << endl;
- sort(tab, tab + N, sortuj);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement