forked from istng/SO-TP1
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest-5.cpp
53 lines (30 loc) · 989 Bytes
/
test-5.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
45
46
47
48
49
50
51
52
53
#include <iostream>
#include <cstdlib>
#include "ConcurrentHashMap.hpp"
#include <list>
using namespace std;
int main(int argc, char **argv) {
pair<string, unsigned int> p;
list<string> l = { "corpus", "corpus-1", "corpus-2", "corpus-3", "corpus-4" };
if (argc != 3) {
cerr << "uso: " << argv[0] << " #tarchivos #tmaximum" << endl;
return 1;
}
p = maximum(atoi(argv[1]), atoi(argv[2]), l);
cout << p.first << " " << p.second << endl;
l = { "corpus", "corpus", "corpus-2", "corpus-3", "corpus-4" };
if (argc != 3) {
cerr << "uso: " << argv[0] << " #tarchivos #tmaximum" << endl;
return 1;
}
p = maximum(atoi(argv[1]), atoi(argv[2]), l);
cout << p.first << " " << p.second << endl;
l = { "corpus", "corpus", "corpus", "corpus-3", "corpus-4" };
if (argc != 3) {
cerr << "uso: " << argv[0] << " #tarchivos #tmaximum" << endl;
return 1;
}
p = maximum(atoi(argv[1]), atoi(argv[2]), l);
cout << p.first << " " << p.second << endl;
return 0;
}