-
Notifications
You must be signed in to change notification settings - Fork 30
/
Copy pathcode_1.cpp
44 lines (38 loc) · 841 Bytes
/
code_1.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
//
// code_1.cpp
// Algorithm
//
// Created by Mohd Shoaib Rayeen on 23/11/18.
// Copyright © 2018 Shoaib Rayeen. All rights reserved.
//
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool myCompare(string X, string Y) {
string XY = X.append(Y);
string YX = Y.append(X);
return XY.compare(YX) > 0 ? 1: 0;
}
void printLargest(vector <string> arr) {
sort(arr.begin(), arr.end(), myCompare);
cout << "\nLargest Number\t:\t";
for (int i=0; i < arr.size() ; i++ ) {
cout << arr[i];
}
cout << "\n";
}
int main() {
int n;
cout << "\nEnter Size\t:\t";
cin >> n;
vector<string> a(n);
cout << "\nEnter Elements\n";
for ( int i = 0; i < n; i++ ) {
cin >> a[i];
}
printLargest(a);
a.clear();
cout << endl;
return 0;
}